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.
Algebrization: A new barrier in complexity theory.ACM Transactions on Computation Theory, 1(1):2:1–2:54, 2009
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Closes the missing direction of an open question on incomparability of two induction theories via a short syntactic argument and extracts the Syntactic Invariance Principle.
Syntactic separation of Skolem functions in local systems implies computational indistinguishability with Omega(n) or Omega(2^n) derivation lower bounds, presented as an abstract obstruction governing Natural Proofs, Type Omitting Theorem, and AC^0 barriers.
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.
-
Syntactic Systems Cannot See Semantic Invariants
Closes the missing direction of an open question on incomparability of two induction theories via a short syntactic argument and extracts the Syntactic Invariance Principle.
-
Syntactic Separation Implies Computational Indistinguishability: An Abstract Obstruction Theorem
Syntactic separation of Skolem functions in local systems implies computational indistinguishability with Omega(n) or Omega(2^n) derivation lower bounds, presented as an abstract obstruction governing Natural Proofs, Type Omitting Theorem, and AC^0 barriers.