Pages that link to "Item:Q3926566"
From MaRDI portal
The following pages link to Classification of Quantifier Prefixes Over Diophantine Equations (Q3926566):
Displayed 9 items.
- Further results on Hilbert's tenth problem (Q829448) (← links)
- Some undecidable determined games (Q1171511) (← links)
- Computational complexity of winning strategies in two-person polynomial games (Q1190954) (← links)
- Sentences over integral domains and their computational complexities (Q1286369) (← links)
- Expository notes on computability and complexity in (arithmetical) games (Q1391661) (← links)
- Uncomputably large integral points on algebraic plane curves? (Q1978704) (← links)
- The many aspects of counting lattice points in polytopes (Q2491985) (← links)
- Extensions of Hilbert's tenth problem (Q4302340) (← links)
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy (Q5943088) (← links)