6 results
QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS
-
- Journal:
- The Journal of Symbolic Logic / Volume 81 / Issue 2 / June 2016
- Published online by Cambridge University Press:
- 10 May 2016, pp. 687-710
- Print publication:
- June 2016
-
- Article
- Export citation
Probabilistic Algorithmic Randomness
-
- Journal:
- The Journal of Symbolic Logic / Volume 78 / Issue 2 / June 2013
- Published online by Cambridge University Press:
- 12 March 2014, pp. 579-601
- Print publication:
- June 2013
-
- Article
- Export citation
Jan Krajíček. Forcing with random variables and proof complexity. London Mathematical Society Lecture Note Series, vol. 232. Cambridge University Press, 2011, xvi + 247 pp.
-
- Journal:
- Bulletin of Symbolic Logic / Volume 18 / Issue 4 / December 2012
- Published online by Cambridge University Press:
- 05 September 2014, pp. 576-578
- Print publication:
- December 2012
-
- Article
- Export citation
Strong isomorphism reductions in complexity theory
-
- Journal:
- The Journal of Symbolic Logic / Volume 76 / Issue 4 / December 2011
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1381-1402
- Print publication:
- December 2011
-
- Article
- Export citation
Minimum propositional proof length is NP-hard to linearly approximate
-
- Journal:
- The Journal of Symbolic Logic / Volume 66 / Issue 1 / March 2001
- Published online by Cambridge University Press:
- 12 March 2014, pp. 171-191
- Print publication:
- March 2001
-
- Article
- Export citation
1998–99 Annual Meeting of the Association for Symbolic Logic
-
- Journal:
- Bulletin of Symbolic Logic / Volume 5 / Issue 3 / September 1999
- Published online by Cambridge University Press:
- 15 January 2014, pp. 395-421
- Print publication:
- September 1999
-
- Article
- Export citation