Category:NL-complete problems
From Wikipedia, the free encyclopedia
This category contains decision problems which are NL-complete, meaning that they are complete for the complexity class NL.
interaction
- This page was last modified 20:31, 2 April 2006 by Wikipedia user Creidieki.
- All text is available under the terms of the GNU Free Documentation License. (See Copyrights for details.)
Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a US-registered 501(c)(3) tax-deductible nonprofit charity. - About Wikipedia
- Disclaimers