Pages that link to "Item:Q4651526"
From MaRDI portal
The following pages link to Pseudorandom Generators in Propositional Proof Complexity (Q4651526):
Displaying 39 items.
- A dichotomy for local small-bias generators (Q315550) (← links)
- More on average case vs approximation complexity (Q430823) (← links)
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- Special issue in memory of Misha Alekhnovich. Foreword (Q430839) (← links)
- Lower bounds for \(k\)-DNF resolution on random 3-CNFs (Q430840) (← links)
- Algebraic proofs over noncommutative formulas (Q642520) (← links)
- On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (Q693058) (← links)
- Substitutions into propositional tautologies (Q845921) (← links)
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas (Q862399) (← links)
- Resolution lower bounds for the weak functional pigeonhole principle. (Q1401365) (← links)
- Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms (Q1678752) (← links)
- The complexity of proving that a graph is Ramsey (Q1705815) (← links)
- Resolution lower bounds for perfect matching principles (Q1881260) (← links)
- The complexity of inverting explicit Goldreich's function by DPLL algorithms (Q1946844) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Hardness assumptions in the foundations of theoretical computer science (Q2388429) (← links)
- A combinatorial characterization of resolution width (Q2475405) (← links)
- (Q3072543) (← links)
- Candidate One-Way Functions Based on Expander Graphs (Q3088178) (← links)
- ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358) (← links)
- Nisan-Wigderson generators in proof systems with forms of interpolation (Q3170558) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- Randomized feasible interpolation and monotone circuits with a local oracle (Q4562441) (← links)
- Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5028364) (← links)
- Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5090407) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
- (Q5092479) (← links)
- Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5112250) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)
- (Q6054746) (← links)
- (Q6062142) (← links)
- The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity (Q6083551) (← links)
- Robustness of average-case meta-complexity via pseudorandomness (Q6083613) (← links)
- ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS (Q6204144) (← links)
- Perfect matching in random graphs is as hard as Tseitin (Q6562700) (← links)
