Tag: boolean-formulas

Found 11 results for 'boolean-formulas'.

---

1) np-hardness - Can this NP-hardness proof for Super Mario Brothers (and other games) be simplified?
2) exp-time-algorithms - The problem of deciding whether a monotone CNF implies a monotone DNF
3) time-complexity - Number of SAT checks that are needed to find all combinations of subset of boolean variables of a propositional formula
4) np-hardness - How hard is it to find a "well-distributed" subset of models of a propositional formula?
5) sat - Conversion between k-SAT and XOR-SAT
6) boolean-functions - May Boolean circuits be exponentially more concise than Boolean formulae?
7) circuit-complexity - Universal Boolean Formulas
8) sat - Minimum Unsatisfiable Core
9) cc.complexity-theory - What is the complexity of the equivalence problem for read-once decision trees?
10) cc.complexity-theory - Treewidth relations between Boolean formulas and Tseitin encodings
11) lo.logic - Efficient transformation into CNF preserving entailment

---