Interpolation by a Game
- 1 January 1998
- journal article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 44 (4), 450-458
- https://doi.org/10.1002/malq.19980440403
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Upper and lower bounds for tree-like cutting planes proofsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmeticThe Journal of Symbolic Logic, 1997
- Monotone circuits for matching require linear depthJournal of the ACM, 1992
- Probabilistic communication complexity of Boolean relationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Monotone circuits for connectivity require super-logarithmic depthPublished by Association for Computing Machinery (ACM) ,1988