World Congress on Engineering and Computer Science, Advances in Electrical and Electronics Engineering - IAENG Special Edition of the (2008)

San Francisco, California, USA

Oct. 22, 2008 to Oct. 24, 2008

ISBN: 978-0-7695-3555-5

pp: 62-66

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WCECS.2008.16

ABSTRACT

Article describes a polynomial time many-one reduction of SAT to a polynomial size asymmetric linear system, where asymmetry means that shape and location of the system's polytope depend on order of clauses in CNF and on order of literals in the clauses.

INDEX TERMS

SAT; Reduction; Linear model; NP-complete

CITATION

Sergey Gubin,
"Polynomial Size Asymmetric Linear Model for SAT",

*World Congress on Engineering and Computer Science, Advances in Electrical and Electronics Engineering - IAENG Special Edition of the*, vol. 00, no. , pp. 62-66, 2008, doi:10.1109/WCECS.2008.16CITATIONS

SEARCH