S. Jukna. Exponential lower bounds on the size of clause based semantic derivations. Submitted to Proceedings of the DIMACS workshop on Feasible Arithmetic and Length of Proofs, 1996. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Read-Once Branching Programs, Rectangular Proofs of the.. - Razborov, Wigderson, Yao (1997) (3 citations) (Correct)
....computations ) Buss and Tur an [BT88] extended his bound to exp i Omega i n 2 m jj for more general form PHP m n of the pigeonhole principle in which the number of pigeons, m is another parameter. See also [Urq87, CS88, BP96] for other bounds on the complexity of resolutions, and [Juk96] for a generalization of the Haken Buss Tur an bound to the case of semantic resolutions. All these bounds trivialize when m n 2 , and all lower bounds techniques discovered so far become void with that many pigeons. As mentioned in [BT88] see also [Kra94, page 31] it is an open question ....
S. Jukna. Exponential lower bounds on the size of clause based semantic derivations. Submitted to Proceedings of the DIMACS workshop on Feasible Arithmetic and Length of Proofs, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC