Counting classes: thresholds, parity, mods, and fewness
- 24 August 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 103 (1) , 3-23
- https://doi.org/10.1016/0304-3975(92)90084-s
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Relativized counting classes: Relations among thresholds, parity, and modsJournal of Computer and System Sciences, 1991
- On the power of parity polynomial timeTheory of Computing Systems, 1990
- Relations among mod-classesTheoretical Computer Science, 1990
- On the construction of parallel computers from various bases of boolean functionsTheoretical Computer Science, 1986
- Constant Depth ReducibilitySIAM Journal on Computing, 1984
- Strong nondeterministic polynomial-time reducibilitiesTheoretical Computer Science, 1982
- On the unique satisfiability problemInformation and Control, 1982
- Relativized Questions Involving Probabilistic AlgorithmsJournal of the ACM, 1982
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- The equivalence problem for regular expressions with squaring requires exponential spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972