Computational complexity of winning strategies in two-person polynomial games (Q1190954): Difference between revisions

@@ Property / cites work @@
+Classification of Quantifier Prefixes Over Diophantine Equations
+Normal rank
@@ Property / cites work @@
+Some undecidable determined games
@@ Property / cites work: Some undecidable determined games / rank @@
+Normal rank
@@ Property / cites work @@
+Reduction of an arbitrary diophantine equation to one in 13 unknowns
+Normal rank
@@ Property / cites work @@
+Q3245637
@@ Property / cites work: Q3245637 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexities of diophantine equations with parameters
+Normal rank
@@ Property / cites work @@
+Q5605051
@@ Property / cites work: Q5605051 / rank @@
+Normal rank