Long Proofs of (Seemingly) Simple Formulas

DOI10.1007/978-3-319-09284-3_10zbMath1423.68463OpenAlexW48421743MaRDI QIDQ3192059

Jakob Nordström, Mladen Mikša

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09284-3_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of block designs (05B05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Another look at degree lower bounds for polynomial calculus ⋮ MaxSAT Resolution and Subcube Sums

Uses Software

• Chaff

This page was built for publication: Long Proofs of (Seemingly) Simple Formulas