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
NL (complexity)
(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!
==NL-completeness== A problem is '''[[NL-complete]]''' iff it is '''NL''', and any problem in '''NL''' is [[log-space reduction|log-space reducible]] to it. Problems that are known to be '''NL'''-complete including [[ST-connectivity]] and [[2-satisfiability]]. [[ST-connectivity]] asks, for nodes ''S'' and ''T'' in a [[directed graph]], whether ''T'' is [[reachability|reachable]] from ''S''. [[2-satisfiability]] asks, given a [[propositional logic|propositional]] formula of which each clause is the [[disjunction]] of two literals, if there is a variable assignment that makes the formula true. An example instance, where <math> \neg </math> indicates ''not'', might be: :<math>(x_1 \vee \neg x_3) \wedge (\neg x_2 \vee x_3) \wedge (\neg x_1 \vee \neg x_2)</math>
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)