@Article{ Pudlak:JSL:1997,
Author = "Pudlak, Pavel",
date-added = "2019-10-09 22:00:07 +0200",
date-modified = "2019-10-15 14:47:01 +0200",
fjournal = "Journal of Symbolic Logic",
Journal = "J. Symbolic Logic",
Month = "09",
Number = "3",
Pages = "981--998",
Publisher = "Association for Symbolic Logic",
Title = "Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations",
URL = "https://projecteuclid.org:443/euclid.jsl/1183745308",
Volume = "62",
Year = "1997",
bdsk-url-1 = "https://projecteuclid.org:443/euclid.jsl/1183745308",
File = "Lower bounds for resolution and cutting plane proofs and monotone computations - 10.2307@2275583 (0) - a - a - o.pdf",
file-2 = "Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations - 2275583 - a - a - o.pdf",
file-3 = "interpol (0) - a - a - o.ps",
file-4 = "Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations - a - a - o.pdf"
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
