NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN (Q5100043): Difference between revisions

@@ Property / cites work @@
+\(\Sigma_ 1^ 1\)-formulae on finite structures
@@ Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the pigeonhole principle
@@ Property / cites work: The complexity of the pigeonhole principle / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
+Normal rank
@@ Property / cites work @@
+Q4501551
@@ Property / cites work: Q4501551 / rank @@
+Normal rank
@@ Property / cites work @@
+Does the polynomial hierarchy collapse if onto functions are invertible?
+Normal rank
@@ Property / cites work @@
+Expander construction in \(\mathrm{VNC}^1\)
@@ Property / cites work: Expander construction in \(\mathrm{VNC}^1\) / rank @@
+Normal rank
@@ Property / cites work @@
+Q3794177
@@ Property / cites work: Q3794177 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4357061
@@ Property / cites work: Q4357061 / rank @@
+Normal rank
@@ Property / cites work @@
+On p-Optimal Proof Systems and Logics for PTIME
@@ Property / cites work: On p-Optimal Proof Systems and Logics for PTIME / rank @@
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+An oracle separating conjectures about incompleteness in the finite domain
+Normal rank
@@ Property / cites work @@
+An oracle builder's toolkit
@@ Property / cites work: An oracle builder's toolkit / rank @@
+Normal rank
@@ Property / cites work @@
+Inverting onto functions.
@@ Property / cites work: Inverting onto functions. / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint NP-Pairs
@@ Property / cites work: Disjoint NP-Pairs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5286672
@@ Property / cites work: Q5286672 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3072543
@@ Property / cites work: Q3072543 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof Complexity
@@ Property / cites work: Proof Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Propositional proof systems, the consistency of first order theories and the complexity of computations
+Normal rank
@@ Property / cites work @@
+Sparse Sets in : Relativizations
@@ Property / cites work: Sparse Sets in : Relativizations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4381398
@@ Property / cites work: Q4381398 / rank @@
+Normal rank
@@ Property / cites work @@
+Logical Foundations of Mathematics and Computational Complexity
+Normal rank
@@ Property / cites work @@
+On the complexity of finding falsifying assignments for Herbrand disjunctions
+Normal rank
@@ Property / cites work @@
+INCOMPLETENESS IN THE FINITE DOMAIN
@@ Property / cites work: INCOMPLETENESS IN THE FINITE DOMAIN / rank @@
+Normal rank
@@ Property / cites work @@
+Count\((q)\) versus the pigeon-hole principle
@@ Property / cites work: Count\((q)\) versus the pigeon-hole principle / rank @@
+Normal rank