Nested PLS (Q535153): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+F30
@@ Property / Mathematics Subject Classification ID: 03F30 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+D15
@@ Property / Mathematics Subject Classification ID: 03D15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+F20
@@ Property / Mathematics Subject Classification ID: 03F20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5886778
@@ Property / zbMATH DE Number: 5886778 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+search problems
@@ Property / zbMATH Keywords: search problems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bounded arithmetic
@@ Property / zbMATH Keywords: bounded arithmetic / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+nested recursion
@@ Property / zbMATH Keywords: nested recursion / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2915010390
@@ Property / OpenAlex ID: W2915010390 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2005
@@ Property / arXiv ID: 1005.2005 / rank @@
+Normal rank
@@ Property / cites work @@
+POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC
+Normal rank
@@ Property / cites work @@
+Q3081638
@@ Property / cites work: Q3081638 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3794177
@@ Property / cites work: Q3794177 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5465358
@@ Property / cites work: Q5465358 / rank @@
+Normal rank
@@ Property / cites work @@
+An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+NP search problems in low fragments of bounded arithmetic
+Normal rank
@@ Property / cites work @@
+On total functions, existence theorems and computational complexity
+Normal rank
@@ Property / cites work @@
+On the complexity of the parity argument and other inefficient proofs of existence
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:535153