Algorithmic Barriers Falling: P=np? by Donald E. Knuth, Edgar G. Daylight

Algorithmic Barriers Falling: P=np?

Donald E. Knuth, Edgar G. Daylight

122 pages missing pub info (editions)

nonfiction computer science history science medium-paced
Powered by AI (Beta)
Loading...

Description

"A prize of $10 from Blum, $10 from Meyer, 4 from Paterson and 30-DM from Schnorr is offered to anyone who first solves the Cook-Karp problem whether P = NP. Blum bet $100 that P = NP against Paterson's $1 that P = NP." -- SIGACT News, January 1...

Read more

Community Reviews

Loading...

Content Warnings

Loading...