On the power of generalized Mod-classes
From MaRDI portal
Recommendations
Cites work
- A comparison of polynomial time reducibilities
- A natural encoding scheme proved probabilistic polynomial complete
- Complexity classes defined by counting quantifiers
- Computational Complexity of Probabilistic Turing Machines
- Counting classes: Thresholds, parity, mods, and fewness
- Gap-definable counting classes
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- On random reductions from sparse sets to tally sets
- On Sets Truth-Table Reducible to Sparse Sets
- On the construction of parallel computers from various basis of Boolean functions
- On unique satisfiability and the threshold behavior of randomized reductions
- PP is as Hard as the Polynomial-Time Hierarchy
- Relating Equivalence and Reducibility to Sparse Sets
- Relations among MOD-classes
- The complexity of combinatorial problems with succinct input representation
- The complexity of computing the permanent
- The power of the middle bit of a \(\#\)P function
Cited in
(11)- On relations between counting communication complexity classes
- The power of the middle bit of a \(\#\)P function
- Generalized modulus power transformations
- Characterizations of reduction classes modulo oracle conditions
- Sur le produit avec compteur modulo un nombre premier
- On some generalizations of abelian power avoidability
- scientific article; zbMATH DE number 7116919 (Why is no real title available?)
- Average-case intractability vs. worst-case intractability
- A note on Mod and generalised Mod classes
- Foundations of block-parallel automata networks
- Relations among MOD-classes
This page was built for publication: On the power of generalized Mod-classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4864444)
