POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC (Q3583040): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of cut-reduction
@@ Property / cites work: On the computational complexity of cut-reduction / rank @@
+Normal rank
@@ Property / cites work @@
+Separation results for the size of constant-depth propositional proofs
+Normal rank
@@ Property / cites work @@
+Relating the bounded arithmetic and polynomial time hierarchies
+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 @@
+Quantified propositional calculi and fragments of bounded arithmetic
+Normal rank
@@ Property / cites work @@
+Bounded arithmetic and the polynomial hierarchy
@@ Property / cites work: Bounded arithmetic and the polynomial hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Existence and feasibility in arithmetic
@@ Property / cites work: Existence and feasibility in arithmetic / rank @@
+Normal rank
@@ Property / cites work @@
+Structure and definability in general bounded arithmetic theories
+Normal rank
@@ Property / cites work @@
+Fragments of bounded arithmetic and the lengths of proofs
+Normal rank
@@ Property / cites work @@
+Notes on polynomially bounded arithmetic
@@ Property / cites work: Notes on polynomially bounded arithmetic / rank @@
+Normal rank