A complexity theory based on Boolean algebra
Journal of the ACM (JACM)
Journal of Computer and System Sciences
A note on the complete problems for complexity classes
Information Processing Letters
NP is as easy as detecting unique solutions
Theoretical Computer Science
Languages that capture complexity classes
SIAM Journal on Computing
Structural complexity 1
Complexity classes without machines: on complete languages for UP
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
On tally relativizations of BP-complexity classes
SIAM Journal on Computing
Complexity classes defined by counting quantifiers
Journal of the ACM (JACM)
Counting classes are at least as hard as the polynomial-time hierarchy
SIAM Journal on Computing
A uniform approach to define complexity classes
Theoretical Computer Science
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
A characterization of the leaf language classes
Information Processing Letters
Succinct Representation, Leaf Languages, and Projection Reductions
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Reducibility, randomness, and intractibility (Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Polynomial reducibilities and upward diagonalizations
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A Generalized Quantifier Concept in Computational Complexity Theory
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
| Hi-index | 0.00 |
Well-known examples of dot-operators are the existential, the counting, and the BP-operator. We will generalize this notion of a dot-operator so that every language A will determine an operator A.. In fact we will introduce the more general notion of promise dot-operators for which the BP-operator is an example. Dot-operators are a refinement of the leaf language concept because the class determined by a leaf language A equals A.P. Moreover we are able to represent not only classes but reducibilities, in fact most of the known polynomial-time reducibilities can be represented by dot-operators. We show that two languages determine the same dot-operator if and only if they are reducible to each other by polylog-time uniform monotone projections.