Lewis 1978 (Renamable Horn Boolean Satisfiability)

From Algorithm Wiki

Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(mn^{2})$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1978 == Reference == https://dl.acm.org/doi/10.1145/322047.322059")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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/doi/10.1145/322047.322059

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Lewis_1978_(Renamable_Horn_Boolean_Satisfiability)&oldid=45625"