Pages that link to "Item:Q1361890"
From MaRDI portal
The following pages link to Complexity of Presburger arithmetic with fixed quantifier dimension (Q1361890):
Displaying 29 items.
- If not empty, NP-P is topologically large (Q688157) (← links)
- Kolmogorov characterizations of complexity classes (Q804291) (← links)
- Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes (Q809600) (← links)
- Downward translations of equality (Q914368) (← links)
- Robust machines accept easy sets (Q914369) (← links)
- Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems (Q915446) (← links)
- A result relating disjunctive self-reducibility to P-immunity (Q915447) (← links)
- On the complexity of ranking (Q920620) (← links)
- On helping by robust oracle machines (Q1097695) (← links)
- Polynomial terse sets (Q1104077) (← links)
- On characterizations of the class PSPACE/poly (Q1107320) (← links)
- Subclasses of Presburger arithmetic and the polynomial-time hierarchy (Q1115858) (← links)
- Graph isomorphism is in the low hierarchy (Q1116696) (← links)
- Random languages for nonuniform complexity classes (Q1179458) (← links)
- Turing machines with few accepting computations and low sets for PP (Q1190987) (← links)
- Logarithmic advice classes (Q1193903) (← links)
- Probabilistic complexity classes and lowness (Q1263979) (← links)
- Separation of complexity classes in Koiran's weak model (Q1338212) (← links)
- Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
- An oracle builder's toolkit (Q1398366) (← links)
- Some consequences of the existnce of pseudorandom generators (Q1822961) (← links)
- Enumerative counting is hard (Q1822963) (← links)
- COMPLEXITY OF SHORT GENERATING FUNCTIONS (Q3119462) (← links)
- Enumerating Projections of Integer Points in Unbounded Polyhedra (Q4638995) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- The Computational Complexity of Integer Programming with Alternations (Q5108263) (← links)
- (Q5155665) (← links)
- Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials (Q5327451) (← links)
- On Presburger arithmetic extended with non-unary counting quantifiers (Q6135772) (← links)
