ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD NP ∩ coNP FUNCTION (Q3094358): Difference between revisions

@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Logical Foundations of Proof Complexity
@@ Property / cites work: Logical Foundations of Proof Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Dual weak pigeonhole principle, Boolean complexity, and derandomization
+Normal rank
@@ Property / cites work @@
+On the weak pigeonhole principle
@@ Property / cites work: On the weak pigeonhole principle / rank @@
+Normal rank
@@ Property / cites work @@
+Tautologies from Pseudo-Random Generators
@@ Property / cites work: Tautologies from Pseudo-Random Generators / rank @@
+Normal rank
@@ Property / cites work @@
+Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds
+Normal rank
@@ Property / cites work @@
+Diagonalization in proof complexity
@@ Property / cites work: Diagonalization in 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 @@
+Some consequences of cryptographical conjectures for \(S_2^1\) and EF
+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 @@
+Hardness vs randomness
@@ Property / cites work: Hardness vs randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Nisan-Wigderson generators in proof systems with forms of interpolation
+Normal rank

ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358): Difference between revisions

Latest revision as of 13:21, 4 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)