scientific article; zbMATH DE number 3874957

From MaRDI portal
Publication:3340499





[For the entire collection see Zbl 0537.00025.] The challenging title of this paper hides the presentation of a new method for testing the satisfiabiliy of propositional calculus formulas in conjunctive normal form (CNF's), using methods of polyhedral combinatorics (and hence linear programming techniques). The family of binomial polytopes is defined and it is proven that each clause of a CNF with N variables and p literals per clause has a corresponding face of a binomial polytope \(B_{N,p}\). The article has a special mathematical beauty and it is based on earlier works by the same author.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340499)