On the construction of parallel computers from various bases of Boolean functions
Theoretical Computer Science
The complexity of sparse sets in P
Proc. of the conference on Structure in complexity theory
Some observations on the connection between counting and recursion
Theoretical Computer Science
Two characterizations of the logarithmic alternation hierarchy
Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
Erratum: On restricting the size of Oracles compared with restricting access to Oracles
SIAM Journal on Computing
SIAM Journal on Computing
The Boolean hierarchy I: structural properties
SIAM Journal on Computing
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
The Boolean hierarchy II: applications
SIAM Journal on Computing
Acta Informatica
PP is closed under intersection
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
SIAM Journal on Computing
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Counting classes are at least as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Polynomial-time 1-Turing reductions from #PH to #P
Theoretical Computer Science
A very hard log-space counting class
Theoretical Computer Science - Special issue on structure in complexity theory
Gap-definable counting classes
Journal of Computer and System Sciences
Complexity classes of optimization functions
Information and Computation
On closure properties of #P in the context of PF&j0;#P
Journal of Computer and System Sciences
On Probabilistic Time and Space
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Counting Classes: Thresholds, Parity, Mods, and Fewness
STACS '90 Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science
On Different Reducibility Notions for Function Classes
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Two remarks on the power of counting
Proceedings of the 6th GI-Conference on Theoretical Computer Science
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On some central problems in computational complexity.
On some central problems in computational complexity.
On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Subtractive Reductions and Complete Problems for Counting Complexity Classes
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The General Notion of a Dot-Operator
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Lower bounds and the hardness of counting properties
Theoretical Computer Science
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane
Electronic Notes in Theoretical Computer Science (ENTCS)
On the counting complexity of propositional circumscription
Information Processing Letters
Complexity of Counting the Optimal Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Counting Complexity of Minimal Cardinality and Minimal Weight Abduction
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Some Computational Problems Related to Pseudo-intents
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Complexity of counting the optimal solutions
Theoretical Computer Science
Counting complexity of propositional abduction
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
On the complexity of computing generators of closed sets
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Counting complexity of propositional abduction
Journal of Computer and System Sciences
Application of logic to integer sequences: a survey
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
An algebraic approach to the complexity of generalized conjunctive queries
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
The Complexity of Reasoning for Fragments of Autoepistemic Logic
ACM Transactions on Computational Logic (TOCL)
Static analysis and optimization of semantic web queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
On the complexity of package recommendation problems
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
From equivalence to almost-equivalence, and beyond--minimizing automata with errors
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
On the complexity of query result diversification
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We explore the potentially "off-by-one" nature of the definitions of counting (#P versus #NP), difference (DP versus DNP), and unambiguous (UP versus UNP; FewP versus FewNP) classes, and make suggestions as to logical approaches in each case. We discuss the strangely differing representations that oracle and predicate models give for counting classes, and we survey the properties of counting classes beyond #P. We ask whether subtracting a #P function from a P function it is no greater than necessarily yields a #P function.