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
P versus NP problem
(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!
===DLIN vs NLIN=== When one substitutes "linear time on a multitape Turing machine" for "polynomial time" in the definitions of P and NP, one obtains the classes [[DLIN]] and [[NLIN]]. It is known<ref>{{cite book |last1=Balcazar |first1=Jose Luis |last2=Diaz |first2=Josep |last3=Gabarro |first3=Joaquim |title=Structural Complexity II |date=1990 |publisher=Springer Verlag |isbn=3-540-52079-1}}, Theorem 3.9</ref> that DLIN β NLIN.
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)