The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj
Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, ...
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
Abstract. The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. Th...
Thomas C. Hales, John Harrison, Sean McLaughlin, T...
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...
In this note we present an approximation algorithm for MAX 2SAT that given a (1 - ) satisfiable instance finds an assignment of variables satisfying a 1 - O( ) fraction of all co...
Moses Charikar, Konstantin Makarychev, Yury Makary...