Open AccessNew Worst-Case Upper Bound for #2-SAT and #3-SAT with the Number of Clauses as the Parameter
Author(s) -
Junping Zhou,
Minghao Yin,
Chunguang Zhou
Publication year - 2010
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v24i1.7537
Subject(s) - upper and lower bounds , mathematics , point (geometry) , time complexity , exploit , conjunctive normal form , ramsey's theorem , boolean satisfiability problem , maximum satisfiability problem , algorithm , computer science , combinatorics , discrete mathematics , boolean function , mathematical analysis , graph , geometry , computer security
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom