Pages that link to "Item:Q4404975"
From MaRDI portal
The following pages link to Reduction of an arbitrary diophantine equation to one in 13 unknowns (Q4404975):
Displayed 17 items.
- Julia Robinson, in memoriam (Q1068805) (← links)
- Primes are nonnegative values of a polynomial in 10 variables (Q1145721) (← links)
- A new proof of the theorem on exponential diophantine representation of enumerable sets (Q1147132) (← links)
- Diophantine representation of perfect numbers (Q1170215) (← links)
- On the zero-inequivalence problem for loop programs (Q1171383) (← links)
- Computational complexity of winning strategies in two-person polynomial games (Q1190954) (← links)
- My collaboration with Julia Robinson (Q1208619) (← links)
- NP-complete decision problems for binary quadratics (Q1243130) (← links)
- A direct method for simulating partial recursive functions by Diophantine equations (Q1326783) (← links)
- Index sets and presentations of complexity classes (Q1366536) (← links)
- Diophantine representations of linear recurrences. I (Q1376907) (← links)
- Skolem functions of arithmetical sentences. (Q1427862) (← links)
- Infiniteness sets of primes, admitting diophantine representations in eight variables (Q1807459) (← links)
- Definability, decidability, complexity (Q1817073) (← links)
- Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets (Q1887829) (← links)
- Diophantine complexity (Q2276953) (← links)
- Undecidable diophantine equations (Q3884098) (← links)