A survey on counting classes
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On the power of parity polynomial timePublished by Springer Nature ,2005
- Nondeterministic Turing machines with modified acceptancePublished by Springer Nature ,2005
- Two remarks on the power of countingPublished by Springer Nature ,2005
- Relativized counting classes: Relations among thresholds, parity, and modsJournal of Computer and System Sciences, 1991
- On the unique satisfiability problemInformation and Control, 1982
- On counting problems and the polynomial-time hierarchyTheoretical Computer Science, 1980
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- First Order Predicate Logic with Generalized QuantifiersTheoria, 1966
- Anzahlquantoren in der Kleene-HierarchieArchive for Mathematical Logic, 1966