Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
2-satisfiability
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Quantified Boolean formulae=== As well as finding the first polynomial-time algorithm for 2-satisfiability, {{harvtxt|Krom|1967}} also formulated the problem of evaluating [[True quantified Boolean formula|fully quantified Boolean formulae]] in which the formula being quantified is a 2-CNF formula. The 2-satisfiability problem is the special case of this quantified 2-CNF problem, in which all quantifiers are [[existential quantifier|existential]]. Krom also developed an effective decision procedure for these formulae. {{harvtxt|Aspvall|Plass|Tarjan|1979}} showed that it can be solved in linear time, by an extension of their technique of strongly connected components and topological ordering.<ref name="Krom1967"/><ref name="APT79"/>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)