Lewis 1978 (Renamable Horn Boolean Satisfiability)
Jump to navigation
Jump to search
Time Complexity
$O(mn^{2})$
Space Complexity
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1978
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/322047.322059