Modular construction of succinct arguments for QMA via OSP-based interactive protocol plus collapsing-hash communication compression compiler, without LWE.
Vizing’s theorem in near-linear time
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 5roles
background 1polarities
background 1representative citing papers
A threshold κ=Θ(1/√α) (α=m/n) separates easy collision finding from OGP-based exponential lower bounds against online algorithms in single-layer binary NNs.
Explicit controlled-SWAP variational circuits generate exact uniform permutation distributions on linear nearest-neighbor topologies in O(n) depth, while Beneš-like architectures cannot produce uniform distributions for any parameter choice.
O(n log n) algorithm for edge-coloring planar graphs with Delta >= 8 using Delta colors, extending prior O(n log n) result for Delta >= 9 and generalizing to bounded-genus graphs.
No single post-Moore technology replaces current HPC for plasma simulations, but FPGA-class accelerators offer near-term kernel offload, non-von Neumann architectures medium-term operator acceleration, and quantum computing long-term potential for warm dense matter microphysics.
citing papers explorer
-
A Modular Approach to Succinct Arguments for QMA
Modular construction of succinct arguments for QMA via OSP-based interactive protocol plus collapsing-hash communication compression compiler, without LWE.
-
Collision Resistance of Single-Layer Neural Nets
A threshold κ=Θ(1/√α) (α=m/n) separates easy collision finding from OGP-based exponential lower bounds against online algorithms in single-layer binary NNs.
-
Variational Approach for Uniform Quantum Permutation Generators
Explicit controlled-SWAP variational circuits generate exact uniform permutation distributions on linear nearest-neighbor topologies in O(n) depth, while Beneš-like architectures cannot produce uniform distributions for any parameter choice.
-
The planar edge-coloring theorem of Vizing in $O(n\log n)$ time
O(n log n) algorithm for edge-coloring planar graphs with Delta >= 8 using Delta colors, extending prior O(n log n) result for Delta >= 9 and generalizing to bounded-genus graphs.
-
Post-Moore Technologies for Plasma Simulation: A Community Roadmap
No single post-Moore technology replaces current HPC for plasma simulations, but FPGA-class accelerators offer near-term kernel offload, non-von Neumann architectures medium-term operator acceleration, and quantum computing long-term potential for warm dense matter microphysics.