Pages that link to "Item:Q2736584"

The following pages link to Tautologies from Pseudo-Random Generators (Q2736584):

Displaying 10 items.

• On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (Q693058) (← links)
• Substitutions into propositional tautologies (Q845921) (← links)
• The complexity of proving that a graph is Ramsey (Q1705815) (← 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)
• ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358) (← links)
• On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
• Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds (Q5311724) (← links)
• Proof Complexity of Non-classical Logics (Q5894972) (← links)
• ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS (Q6204144) (← links)