Polynomial Time Computer Science (13 results)
Language: English
Published by Springer 2004
Series: Lecture Notes in Computer Science, Book 21 of 58. Book 21 of 58 - Lecture Notes in Computer Science
- Softcover
Seller: Recycle Bookstore, San Jose, CA, U.S.A.Recycle Bookstore
Contact seller4-star sellerCondition: Used - Very good
US$ 27.95
US$ 5.75 shippingShips within U.S.A.Quantity: 1 available
Paperback. Condition: Very Good. Book has faint rubbing to covers, light wear to edges, a small smudge to bottom textblock. otherwise in great condition, strong binding, bright and unmarked pages; an overall sturdy copy with clean interiors.
Language: English
Published by Springer 2004
Series: Lecture Notes in Computer Science, Book 21 of 58. Book 21 of 58 - Lecture Notes in Computer Science
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 68.88
US$ 15.77 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
Language: English
Published by Springer 2008-06-13 2008
Series: Lecture Notes in Computer Science, Book 21 of 58. Book 21 of 58 - Lecture Notes in Computer Science
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
US$ 64.36
US$ 20.39 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
Paperback. Condition: New.
Language: English
Published by Springer 2004
Series: Lecture Notes in Computer Science, Book 21 of 58. Book 21 of 58 - Lecture Notes in Computer Science
- Softcover
Seller: BennettBooksLtd, Los Angeles, CA, U.S.A.BennettBooksLtd
Contact seller5-star sellerCondition: New
US$ 116.44
US$ 6.95 shippingShips within U.S.A.Quantity: 1 available
paperback. Condition: New. In shrink wrap. Looks like an interesting title.
Language: German
Published by Berlin. Springer Verlag. 2004
Series: Lecture Notes in Computer Science, Book 21 of 58. Book 21 of 58 - Lecture Notes in Computer Science
- Softcover
Seller: Antiquariat Bernhardt, Kassel, GermanyAntiquariat Bernhardt
Contact seller5-star sellerCondition: Used - Fine
US$ 35.87
US$ 56.66 shippingShips from Germany to U.S.A.Quantity: 1 available
kartoniert kartoniert. Condition: Sehr gut. 147 Seiten, mit Abbildungen, Zust: Gutes Exemplar. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versend…en mit der deutschen Post. Sprache: Deutsch Gewicht in Gramm: 252.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 41.98
US$ 68.87 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field. In essence, the… question P = NP asks: if 'yes'-answers to a 'yes'-or-'no'-question can be verified 'quickly', can the answers themselves also be computed quickly An answer to the P = NP question would determine whether problems like the subset-sum problem are as 'easy' to compute as to verify. If it turned out P does not equal NP, it would mean that some NP problems are substantially 'harder' to compute than to verify.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 41.98
US$ 68.94 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In computational complexity theory, the complexity class NP-complete (abbreviated NP-C or NPC), is a class of problems having two properties: Any given solution to the problem can be verified q…uickly (in polynomial time); the set of problems with this property is called NP (nondeterministic polynomial time). If the problem can be solved quickly (in polynomial time), then so can every problem in NP. Although any given solution to such a problem can be verified quickly, there is no known efficient way to locate a solution in the first place; indeed, the most notable characteristic of NP-complete problems is that no fast solution to them is known. That is, the time required to solve the problem using any currently known algorithm increases very quickly as the size of the problem grows. As a result, the time required to solve even moderately large versions of many of these problems easily reaches into the billions or trillions of years, using any amount of computing power available today. As a consequence, determining whether or not it is possible to solve these problems quickly is one of the principal unsolved problems in computer science today.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 54.03
US$ 69.32 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! This article is a list of unsolved problems in computer science. Solutions to the problems in this list would have a major impact on the field of study to which they belong.Computer science or…computing science (sometimes abbreviated CS) is the study of the theoretical foundations of information and computation, and of practical techniques for their implementation and application in computer systems. It is frequently described as the systematic study of algorithmic processes that create, describe, and transform information. According to Peter J. Denning, the fundamental question underlying computer science is, 'What can be (efficiently) automated ' Computer science has many sub-fields; some, such as computer graphics, emphasize the computation of specific results, while others, such as computational complexity theory, study the properties of computational problems.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 54.03
US$ 69.41 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In computer science, polynomial time refers to the running time of an algorithm, that is, the number of computation steps a computer or an abstract machine requires to evaluate the algorithm. A…n algorithm is said to be polynomial time if its running time is upper bounded by a polynomial in the size of the input for the algorithm. Problems for which a polynomial time algorithm exists belong to the complexity class PTIME, which is central in the field of computational complexity theory. Cobham's thesis states that polynomial time is a synonym for 'tractable', 'feasible', 'efficient', or 'fast'.
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 128.47
US$ 79.48 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. NP-Complete | Computational Complexity Theory, Complexity Class, Polynomial Time, Unsolved Problems in Computer Science, Approximation Algorithm, Subset | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130333287 | Verantwortliche Person für die EU: preigu GmbH & C…o. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 128.47
US$ 79.48 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. P Versus NP Problem | Complexity Class, Theoretical Computer Science, Decision Problem, Polynomial Time, Subset Sum Problem, Subset | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130335588 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher La…ndstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 168.29
US$ 79.48 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Polynomial Time | Computer Science, Analysis of Algorithms, Algorithm, Computation, Abstract Machine, Upper and Lower Bounds, Complexity Class, P Complexity | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130338329 | Verantwortliche Person für die EU: preigu GmbH… & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 168.29
US$ 79.48 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Unsolved Problems in Computer Science | List of Unsolved Problems, Computer Science, Theory of Computation, Stephen Cook, Leonid Levin, Polynomial Time | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131122781 | Verantwortliche Person für die EU: preigu GmbH & Co…. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
