[Home]NP-Hard

HomePage | Recent Changes | Preferences

Showing revision 4
Difference (from revision 4 to revision 4) (minor diff, author diff)
(The revisions are identical or unavailable.)
Non-Polynominal hard - a type of computability? problem; see Complexity theory


HomePage | Recent Changes | Preferences
This page is read-only | View other revisions | View current revision
Edited December 3, 2001 7:19 pm by Hannes Hirzel (diff)
Search: