This section doesn’t currently include any content. Add content to this section using the sidebar.

Image caption appears here

Add your deal, information or promotional text

1976 Press Photo Store Boolean Problem Complete Cook

Every photo in our collection is an original vintage print from a newspaper or news service archive, not a digital image. Please see our FAQ for more information.

Description
One of the most important results in computational complexity theory was Stephen Cook's 1971 demonstration of the first (practically relevant) NP-complete problem, the boolean satisfiability problem t

10 x 8.25 inches., Photo year: 1976

Photo back:

Add to Wishlist

Search