Establishes L membership for identity acceptors, all F in commutative monoids, and L(R)-commutative UoG monoids, plus NL-completeness dichotomies for BA2 and U, using product graphs and Green's relations.
and Lipton, Richard J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
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
-
On the Reachability Problem on Monoid-Labelled Undirected Graphs
Establishes L membership for identity acceptors, all F in commutative monoids, and L(R)-commutative UoG monoids, plus NL-completeness dichotomies for BA2 and U, using product graphs and Green's relations.
-
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.