Renamable Horn
Renamable Horn asks the question whether or not there exists a subset of variables that can be negated such that the boolean formula is turned into a Horn formula
Parameters
- : number of variables
- : number of clauses
Related Problems
- SAT2
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Displaying 1 of 1 algorithms
| See more | ||||
|---|---|---|---|---|
| Lewis 1978 | 1978 | O(mn^2) |
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table