On the power of generalized Mod-classes
From MaRDI portal
Publication:4864444
DOI10.1007/BF01201812zbMath0840.68044OpenAlexW2128094054MaRDI QIDQ4864444
Seinosuke Toda, Johannes Köbler
Publication date: 1 July 1996
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01201812
Related Items
On relations between counting communication complexity classes ⋮ Average-case intractability vs. worst-case intractability ⋮ A note on Mod and generalised Mod classes
Cites Work
- Unnamed Item
- A natural encoding scheme proved probabilistic polynomial complete
- The complexity of computing the permanent
- On random reductions from sparse sets to tally sets
- Relations among MOD-classes
- On the construction of parallel computers from various basis of Boolean functions
- The complexity of combinatorial problems with succinct input representation
- A comparison of polynomial time reducibilities
- Gap-definable counting classes
- On unique satisfiability and the threshold behavior of randomized reductions
- The power of the middle bit of a \(\#\)P function
- PP is as Hard as the Polynomial-Time Hierarchy
- On Sets Truth-Table Reducible to Sparse Sets
- Relating Equivalence and Reducibility to Sparse Sets
- Computational Complexity of Probabilistic Turing Machines
- Complexity classes defined by counting quantifiers
- Counting classes: Thresholds, parity, mods, and fewness
This page was built for publication: On the power of generalized Mod-classes
