M.L.Bonet, S.R.Buss and T.Pitassi: "Are there hard examples for Frege systems?", this volume. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
On Frege and Extended Frege Proof Systems - Krajicek (1993) (2 citations) (Correct)
....This was successful in the cases of resolution and constant depth Frege systems where the most frequently used principle is the pigeonhole principle. However, no example of a combinatorial statement which would make a plausible candidate for being hard for F or EF is known at present. 1 1 See [6]. In that paper and in [3] are also constructed polynomial size Frege proofs of the Bondy theorem [4] which we suggested in [14] as a possible candidate of a principle hard for F . It is conceivable that a direct combinatorial approach is not sufficient or that it is too difficult similarly ....
M.L.Bonet, S.R.Buss and T.Pitassi: "Are there hard examples for Frege systems?", this volume.
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