The following pages link to Ján Pich (Q466446):
Displaying 16 items.
- Circuit lower bounds in bounded arithmetics (Q466447) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic (Q2941756) (← links)
- Nisan-Wigderson generators in proof systems with forms of interpolation (Q3170558) (← links)
- Understanding Gentzen and Frege Systems for QBF (Q4635870) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5028364) (← links)
- Reasons for Hardness in QBF Proof Systems (Q5053061) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
- Frege Systems for Quantified Boolean Logic (Q5133965) (← links)
- (Q5136303) (← links)
- (Q5875777) (← links)
- Beyond Natural Proofs: Hardness Magnification and Locality (Q5889786) (← links)
- Strong co-nondeterministic lower bounds for NP cannot be proved feasibly (Q6086996) (← links)
- Beyond Natural Proofs: Hardness Magnification and Locality (Q6329480) (← links)
- Learning algorithms versus automatability of Frege systems (Q6560900) (← links)
- Localizability of the approximation method (Q6624428) (← links)