Pages that link to "Item:Q4404975"

The following pages link to Reduction of an arbitrary diophantine equation to one in 13 unknowns (Q4404975):

Displaying 30 items.

• Diophantine questions in the class of finitely generated nilpotent groups (Q285579) (← links)
• Further results on Hilbert's tenth problem (Q829448) (← links)
• 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)
• Prime representing polynomial (Q2171524) (← links)
• On a theorem of Matiyasevich (Q2210378) (← links)
• Diophantine complexity (Q2276953) (← links)
• Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two (Q2676823) (← links)
• The quest for Diophantine finite-fold-ness (Q3383639) (← links)
• Undecidable diophantine equations (Q3884098) (← links)
• (Q5087790) (← links)
• (Q5150533) (← links)
• ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM (Q5151075) (← links)
• Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank (Q6085106) (← links)
• Prime representing polynomial with 10 unknowns -- introduction (Q6489409) (← links)
• FLSwitch: towards secure and fast model aggregation for federated deep learning with a learning state-aware switch (Q6535091) (← links)
• Undecidability of the submonoid membership problem for a sufficiently large finite direct power of the Heisenberg group (Q6587386) (← links)