z-logo
open-access-imgOpen Access
Efficient Binary Linear Programming Formulations for Boolean Functions
Author(s) -
Frank Gurski
Publication year - 2014
Publication title -
statistics optimization and information computing
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 0.297
H-Index - 12
eISSN - 2311-004X
pISSN - 2310-5070
DOI - 10.19139/83
Subject(s) - boolean function , linear programming , maximum satisfiability problem , mathematics , equivalence (formal languages) , boolean expression , discrete mathematics , binary decision diagram , parity function , binary number , boolean data type , complete boolean algebra , two element boolean algebra , combinatorics , algorithm , algebra over a field , pure mathematics , arithmetic , filtered algebra

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom