Category:NL-complete problems

From Wikipedia, the free encyclopedia

Revision as of 20:31, 2 April 2006 by imported>Creidieki (move to Category:Computational problems)

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

Jump to navigation Jump to search

This category contains decision problems which are NL-complete, meaning that they are complete for the complexity class NL.

Script error: No such module "anchor".Pages in category "NL-complete problems"

The following 2 pages are in this category, out of 2 total.

2

2-satisfiability

S

St-connectivity

Retrieved from "http://debianws.lexgopc.com/wiki143/index.php?title=Category:NL-complete_problems&oldid=2685691"

Computational problems