Dynamic planar graph isomorphism is maintainable in DynFO via FO formulas and polynomial auxiliary data.
Self-testing of quantum circuits , Year =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Introduces neighbourhood balancing games on weighted graphs as generalizations of Wardrop and congestion games and studies equilibria existence and efficiency.
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
citing papers explorer
-
Dynamic Planar Graph Isomorphism is in DynFO
Dynamic planar graph isomorphism is maintainable in DynFO via FO formulas and polynomial auxiliary data.
-
Nonatomic Non-Cooperative Neighbourhood Balancing Games
Introduces neighbourhood balancing games on weighted graphs as generalizations of Wardrop and congestion games and studies equilibria existence and efficiency.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.