The following pages link to Pavel Pudlák (Q185618):
Displaying 32 items.
- Partition expanders (Q2363958) (← links)
- Threshold circuits of bounded depth (Q2366275) (← links)
- Proofs as Games (Q2757489) (← links)
- (Q2785569) (← links)
- On the computational power of depth 2 circuits with threshold and modulo gates (Q2817596) (← links)
- Parity Games and Propositional Proofs (Q2849902) (← links)
- On the complexity of circuit satisfiability (Q2875150) (← links)
- On extracting computations from propositional proofs (a survey). (Q2908835) (← links)
- On the joint entropy of $d$-wise-independent variables (Q2955942) (← links)
- (Q2965495) (← links)
- (Q2998376) (← links)
- (Q3079690) (← links)
- (Q3140631) (← links)
- (Q3140637) (← links)
- (Q3315507) (← links)
- (Q3344188) (← links)
- (Q3348859) (← links)
- (Q3359762) (← links)
- A note on bounded arithmetic (Q3360848) (← links)
- (Q3424881) (← links)
- On Search Problems in Complexity Theory and in Logic (Abstract) (Q3434537) (← links)
- (Q4601841) (← links)
- INCOMPLETENESS IN THE FINITE DOMAIN (Q4640304) (← links)
- Parallel strategies (Q4650280) (← links)
- An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle (Q4847394) (← links)
- Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs (Q4892411) (← links)
- A wild model of linear arithmetic and discretely ordered modules (Q5108127) (← links)
- (Q5111131) (← links)
- (Q5111133) (← links)
- (Q5111416) (← links)
- Fragments of bounded arithmetic and the lengths of proofs (Q5502825) (← links)
- <i>Logic, Automata, and Computational Complexity: The Works Of Stephen A. Cook</i>. Edited by Bruce M. Kapron, ACM Books, vol. 43. Association for Computing Machinery, New York, xxvi + 398 pp.—therein: - Michelle Waitzman. <i>Stephen Cook: Complexity’ (Q6199172) (← links)
