Relations among MOD-classes
From MaRDI portal
Publication:914370
DOI10.1016/0304-3975(90)90081-RzbMath0701.68029MaRDI QIDQ914370
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (13)
Representing Boolean functions as polynomials modulo composite numbers ⋮ Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria ⋮ On helping by parity-like languages ⋮ Block interpolation: a framework for tight exponential-time counting complexity ⋮ Geometric sets of low information content ⋮ On the power of generalized Mod-classes ⋮ Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes ⋮ A note on Mod and generalised Mod classes ⋮ Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy ⋮ Counting classes: Thresholds, parity, mods, and fewness ⋮ Graph isomorphism is low for PP ⋮ Quantum and classical complexity classes: Separations, collapses, and closure properties ⋮ Tally NP sets and easy census functions.
Cites Work
This page was built for publication: Relations among MOD-classes
