Map
Index
Random
Help
th

Quote: with NP-complete problems, one knows how to solve the problem but does not have enough time

topics > all references > references p-r > QuoteRef: rabiMO8_1974 , p. 618



Topic:
algorithmic complexity analysis

Quotation Skeleton

[For NP-complete problems:] We have all the tools that we … time.   Google-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

Topic: algorithmic complexity analysis (10 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.