Pages that link to "Item:Q1063589"
From MaRDI portal
The following pages link to Real addition and the polynomial hierarchy (Q1063589):
Displayed 10 items.
- Simple sentences that are hard to decide (Q810009) (← links)
- A bibliography of quantifier elimination for real closed fields (Q1103610) (← links)
- Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
- Saturation and stability in the theory of computation over the reals (Q1304539) (← links)
- Computing over the reals with addition and order (Q1338216) (← links)
- The complexity of query evaluation in indefinite temporal constraint databases (Q1369238) (← links)
- Temporal reasoning about fuzzy intervals (Q2389652) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems (Q5958118) (← links)
- Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning (Q5958761) (← links)