Complexity Class Computational Theory (21 results)
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 36.53
US$ 68.85 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! In computational complexity theory, SL (Symmetric Logspace or Sym-L) is the complexity class of problems log-space reducible to USTCON (undirected s-t connectivity), which is the problem of det…ermining whether there exists a path between two vertices in an undirected graph, otherwise described as the problem of determining whether two vertices are in the same connected component. This problem is also called the undirected reachability problem. It does not matter whether many-one reducibility or Turing reducibility is used. Although originally described in terms of symmetric Turing machines, that equivalent formulation is very complex, and the reducibility definition is what is used in practice.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 36.53
US$ 68.88 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In computational complexity theory, RL (Randomized Logarithmic-space), sometimes called RLP (Randomized Logarithmic-space Polynomial-time), is the complexity class of problems solvable in logarithmic space and polynomial time with probab…ilistic Turing machines with one-sided error. It is named in analogy with RP, which is similar but has no logarithmic space restriction. The probabilistic Turing machines in the definition of RL never accept incorrectly but are allowed to reject incorrectly less than 1/3 of the time; this is called one-sided error. The constant 1/3 is arbitrary; any x with 0 x 1/2 would suffice. This error can be made 2 p(x) times smaller for any polynomial p(x) without using more than polynomial time or logarithmic space by running the algorithm repeatedly.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 42.00
US$ 68.92 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational complexity theory, SNP (from Strict NP) is a complexity class containing a limited subset of… NP based on its logical characterization in terms of graph-theoretical properties. It forms the basis for the definition of the class MaxSNP of optimization problems. One characterization of the complexity class NP, shown by Ronald Fagin in 1974 and related to Fagin''s theorem, is that it is the set of problems that can be reduced to properties of graphs expressible in existential second-order logic. This logic allows universal ( ) and existential ( ) quantification over vertices, but only existential quantification over sets of vertices and relations between vertices. SNP retains existential quantification over sets and relations, but only permits universal quantification over vertices.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 42.00
US$ 68.99 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$ 47.49
US$ 69.16 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, NP is one of the most fundamental complexity classes. The abbreviation NP refers to 'nondeterministic polynomial time'. Intuitively, NP is the set of all dec…ision problems for which the 'yes'-answers have simple proofs of the fact that the answer is indeed 'yes'. More precisely, these proofs have to be verifiable in polynomial time by a deterministic Turing machine. In an equivalent formal definition, NP is the set of decision problems solvable in polynomial time by a non-deterministic Turing machine. The complexity class P is contained in NP, but NP contains many important problems, the hardest of which are called NP-complete problems, for which no polynomial-time algorithms are known. The most important open question in complexity theory, the P = NP problem, asks whether such algorithms actually exist for NP-complete, and by corollary, all NP problems. It is widely believed that this is not the case.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 47.49
US$ 69.26 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computability theory and computational complexity theory, a reduction is a transformation of one problem i…nto another problem. Depending on the transformation used this can be used to define complexity classes on a set of problems. Intuitively, problem A is reducible to problem B if solutions to B exist and give solutions to A whenever A has solutions. Thus, solving A cannot be harder than solving B. We write A B, usually with a subscript on the to indicate the type of reduction being used.
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 110.47
US$ 79.53 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Arthur-Merlin protocol | Computational complexity theory, Interactive proof system, Random number generation, Complexity class, Decision problem, Polynomial hierarchy | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131866173 | Verantwortliche Person für die EU: p…reigu 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$ 110.47
US$ 79.53 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. EXPTIME | EXPTIME, Computational complexity theory, Complexity class, Decision problem, DTIME, P (complexity), NP (complexity), PSPACE, NEXPTIME, EXPSPACE, Time hierarchy theorem, Space hierarchy theorem | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130702250 |… 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$ 110.47
US$ 79.53 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. RL (Complexity) | Computational Complexity Theory, Complexity Class, Logarithmic Space, Polynomial Time, Probabilistic Turing Machine | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131257681 | 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$ 110.47
US$ 79.53 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. SL (Complexity) | Computational Complexity Theory, Complexity Class, Log- Space Reducible, Symmetric Turing Machine | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131168857 | 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: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 137.37
US$ 68.88 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 137.37
US$ 68.88 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 128.56
US$ 79.53 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Complexity Class | Computational complexity theory, Computational problem, Abstract machine, Big O notation, NP (complexity), Decision problem, Polynomial time, PSPACE, Turing machine, Function problem, FP (complexity) | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN…9786130694197 | 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$ 128.56
US$ 79.53 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. SNP (Complexity) | Computational Complexity Theory, Complexity Class, Graph Theory, Optimization Problem, Ronald Fagin, Fagin's Theorem | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131244827 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengeriche…r 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.56
US$ 79.53 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Parity P | Computational Complexity Theory, Complexity Class | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786133196421 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Pr…int on Demand.
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 128.56
US$ 79.53 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$ 146.63
US$ 79.53 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Reduction (Complexity) | Computability Theory, Computational Complexity Theory, Computational Problem, Complexity Class | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131308765 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 4…9078 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$ 146.63
US$ 79.53 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. NP (Complexity) | Computational Complexity Theory, Complexity Class, Polynomial, Turing Machine, Decision Problem, Algorithm, P versus NP Problem, Subset Sum Problem | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130333348 | Verantwortliche Person für die EU: pr…eigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 161.06
US$ 68.95 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 161.06
US$ 69.06 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 161.06
US$ 68.99 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.
