The P=NP Question and Gödel’s Lost Letter (Record no. 110725)

000 -LEADER
fixed length control field 04179nam a22005295i 4500
001 - CONTROL NUMBER
control field 978-1-4419-7155-5
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140220084511.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100825s2010 xxu| s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781441971555
-- 978-1-4419-7155-5
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-1-4419-7155-5
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA75.5-76.95
072 #7 - SUBJECT CATEGORY CODE
Subject category code UY
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM014000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM031000
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Lipton, Richard J.
Relator term author.
245 14 - TITLE STATEMENT
Title The P=NP Question and Gödel’s Lost Letter
Medium [electronic resource] /
Statement of responsibility, etc by Richard J. Lipton.
264 #1 -
-- Boston, MA :
-- Springer US,
-- 2010.
300 ## - PHYSICAL DESCRIPTION
Extent XIII, 239p. 20 illus.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note A Prologue -- A Walk In the Snow -- On the P=NP Question -- Algorithms: Tiny Yet Powerful -- Is P=NP Well Posed? -- What Would You Bet? -- What Happens When P=NP Is Resolved? -- NP Too Big or P Too Small? -- How To Solve P=NP? -- Why Believe P Not Equal To NP? -- A Nightmare About SAT -- Bait and Switch -- Who’s Afraid of Natural Proofs? -- An Approach To P=NP -- Is SAT Easy? -- SAT is Not Too Easy -- Ramsey’s Theorem and NP -- Can They Do That? -- Rabin Flips a Coin -- A Proof We All Missed -- Barrington Gets Simple -- Exponential Algorithms -- An EXPSPACE Lower Bound -- Randomness has Unbounded Power -- Counting Cycles and Logspace -- Ron Graham Gives a Talk -- An Approximate Counting Method -- Easy and Hard Sums -- How To Avoid O-Abuse -- How Good is The Worst Case Model? -- Savitch’s Theorem -- Adaptive Sampling and Timed Adversaries -- On The Intersection of Finite Automata -- Where are the Movies? -- On Integer Factoring -- Factoring and Factorials -- BDD’s -- Factoring and Fermat -- On Mathematics -- A Curious Algorithm -- Edit Distance -- Protocols -- Erd?s and the Quantum Method -- Amplifiers -- Amplifying on the PCR Amplifier -- Mathematical Embarrassments -- Mathematical Diseases -- Mathematical Surprises -- Erratum.
520 ## - SUMMARY, ETC.
Summary, etc The P=NP question is one of the great problems of science, which has intrigued computer scientists and mathematicians for decades. Despite the abundant research in theoretical computer science regarding the P=NP question, it has not been solved. The P=NP Question and Gödel’s Lost Letter covers historical developments (including the Gödel’s Lost letter), the importance of P=NP and the future of P=NP. This guide is also based on a new blog by the author, located at http://rjlipton.wordpress.com. Jin-Yi Cai, a professor in computer science at the University of Wisconsin remarks 'I think it is the single most interesting web blog I have seen on related topics. He has a great insight and wit and beautiful way to see things and explain them.' Richard DeMillo, a professor in computer science at Georgia Tech remarks, 'This is a much needed treatment of great open problem computing.' The P=NP Question and Gödel’s Lost Letter is designed for advanced level students and researchers in computer science, and mathematics as a secondary text and reference book. Computer programmers, software developers and IT professionals working in the related industry of computer science theory, will also find this guide a valuable asset.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Information theory.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Logic, Symbolic and mathematical.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Theory of Computation.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematics of Computing.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element History of Computing.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematical Logic and Foundations.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9781441971548
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-1-4419-7155-5
912 ## -
-- ZDB-2-SCS

No items available.

2017 | The Technical University of Kenya Library | +254(020) 2219929, 3341639, 3343672 | library@tukenya.ac.ke | Haile Selassie Avenue