Map
Index
Random
Help
th

Note: perhaps P != NP is true but unproveable

topics > all references > references c-d > QuoteRef: cbb_2000 , p. 2004-07-09



Topic:
algorithmic complexity analysis

Quotation

Perhaps] P != NP is true but unproveable   Google-1   Google-2

personal notes


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.