Pages that link to "Item:Q1115859"
From MaRDI portal
The following pages link to Dominoes and the complexity of subclasses of logical theories (Q1115859):
Displaying 16 items.
- Simple sentences that are hard to decide (Q810009) (← links)
- Subclasses of Presburger arithmetic and the polynomial-time hierarchy (Q1115858) (← links)
- Complexity of logical theories involving coprimality (Q1202924) (← links)
- Sentences over integral domains and their computational complexities (Q1286369) (← links)
- Complexity of Presburger arithmetic with fixed quantifier dimension (Q1361890) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- NP satisfiability for arrays as powers (Q2152659) (← links)
- Emptiness problems for integer circuits (Q2182324) (← links)
- Decidable subsets of open logic and an algorithm for R-calculus (Q2515454) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- (Q3341896) (← links)
- On the Restraining Power of Guards (Q4948538) (← links)
- Undecidability results on two-variable logics (Q5048929) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- Emptiness Problems for Integer Circuits (Q5111247) (← links)
- Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials (Q5327451) (← links)