Computational Complexity Local Algorithms (18 results)
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 103.82
US$ 2.64 shippingShips within U.S.A.Quantity: 15 available
Condition: New.
Language: English
Published by Springer International Publishing AG, Cham 2025
- Softcover
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contact seller5-star sellerCondition: New
US$ 106.47
Free ShippingShips within U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. This volume contains a collection of studies in the areas of complexity theory and local algorithms. A common theme in most of the papers is the interplay between randomness and computation. This interplay is pivotal to some parts of complexity theory and is essential for local algorithms.Th…e works included address a variety of topics in the areas of complexity theory and local algorithms. Within complexity theory the topics include approximation algorithms, counting problems, enumeration problems, explicit construction of expander graphs, fine grained complexity, interactive proof systems, PPT-search and pseudodeterminism, space complexity, and worst-case to average-case reductions. Within local algorithms the focus is mostly on property testing and on locally testable and decodable codes. In particular, many of the works seek to advance the study of testing graph properties in the bounded-degree graph model. Other topics in property testing include testing group properties and testing properties of affine subspaces. This volume contains a collection of studies in the areas of complexity theory and local algorithms. Other topics in property testing include testing group properties and testing properties of affine subspaces. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller4-star sellerCondition: New
US$ 108.00
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 114.47
US$ 2.64 shippingShips within U.S.A.Quantity: 15 available
Condition: As New. Unread book in perfect condition.
Language: English
Published by Springer International Publishing AG, CH 2025
- Softcover
Seller: Rarewaves.com USA, London, LONDO, United KingdomRarewaves.com USA
Contact seller5-star sellerCondition: New
US$ 122.61
Free ShippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: New.
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
US$ 136.06
US$ 3.99 shippingShips within U.S.A.Quantity: 4 available
Condition: New.
- Softcover
Seller: Revaluation Books, Exeter, , United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 148.70
US$ 16.78 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Paperback. Condition: Brand New. 461 pages. 9.26x6.11x9.21 inches. In Stock.
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 92.38
US$ 81.27 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Computational Complexity and Local Algorithms | On the Interplay Between Randomness and Computation | Oded Goldreich | Taschenbuch | Lecture Notes in Computer Science | x | Englisch | 2025 | Springer | EAN 9783031889455 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 691…21 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 102.35
US$ 73.71 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains a collection of studies in the areas of complexity theory and local algorithms. A common theme in most of the papers is the interplay between randomness and computation. This interplay is pivotal to some parts of complexity the…ory and is essential for local algorithms.The works included address a variety of topics in the areas of complexity theory and local algorithms. Within complexity theory the topics include approximation algorithms, counting problems, enumeration problems, explicit construction of expander graphs, fine grained complexity, interactive proof systems, PPT-search and pseudodeterminism, space complexity, and worst-case to average-case reductions. Within local algorithms the focus is mostly on property testing and on locally testable and decodable codes. In particular, many of the works seek to advance the study of testing graph properties in the bounded-degree graph model. Other topics in property testing include testing group properties and testing properties of affine subspaces.
Language: English
Published by Springer International Publishing AG, Cham 2025
- Softcover
Seller: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contact seller5-star sellerCondition: New
US$ 167.40
US$ 37.00 shippingShips from Australia to U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. This volume contains a collection of studies in the areas of complexity theory and local algorithms. A common theme in most of the papers is the interplay between randomness and computation. This interplay is pivotal to some parts of complexity theory and is essential for local algorithms.Th…e works included address a variety of topics in the areas of complexity theory and local algorithms. Within complexity theory the topics include approximation algorithms, counting problems, enumeration problems, explicit construction of expander graphs, fine grained complexity, interactive proof systems, PPT-search and pseudodeterminism, space complexity, and worst-case to average-case reductions. Within local algorithms the focus is mostly on property testing and on locally testable and decodable codes. In particular, many of the works seek to advance the study of testing graph properties in the bounded-degree graph model. Other topics in property testing include testing group properties and testing properties of affine subspaces. This volume contains a collection of studies in the areas of complexity theory and local algorithms. Other topics in property testing include testing group properties and testing properties of affine subspaces. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Language: English
Published by Springer International Publishing AG, CH 2025
- Softcover
Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK
Contact seller5-star sellerCondition: New
US$ 118.91
US$ 87.26 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: New.
- Softcover
- Print on Demand
Seller: Revaluation Books, Exeter, , United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 89.87
US$ 16.78 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Brand New. 461 pages. 9.26x6.11x9.21 inches. In Stock. This item is printed on demand.
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 102.35
US$ 26.70 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This volume contains a collection of studies in the areas of complexity theory and local algorithms. A common theme in most of the papers is the interplay between randomness and computation. This interplay is pivotal to some parts o…f complexity theory and is essential for local algorithms.The works included address a variety of topics in the areas of complexity theory and local algorithms. Within complexity theory the topics include approximation algorithms, counting problems, enumeration problems, explicit construction of expander graphs, fine grained complexity, interactive proof systems, PPT-search and pseudodeterminism, space complexity, and worst-case to average-case reductions. Within local algorithms the focus is mostly on property testing and on locally testable and decodable codes. In particular, many of the works seek to advance the study of testing graph properties in the bounded-degree graph model. Other topics in property testing include testing group properties and testing properties of affine subspaces. 464 pp. Englisch.
- Softcover
- Print on Demand
Seller: moluna, Greven, , Germanymoluna
Contact seller5-star sellerCondition: New
US$ 89.34
US$ 56.88 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt.
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, , United KingdomMajestic Books
Contact seller4-star sellerCondition: New
US$ 139.22
US$ 8.73 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand.
Language: English
Published by Springer International Publishing AG, Cham 2025
- Softcover
- Print on Demand
Seller: CitiRetail, Stevenage, United KingdomCitiRetail
Contact seller5-star sellerCondition: New
US$ 106.46
US$ 49.67 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. This volume contains a collection of studies in the areas of complexity theory and local algorithms. A common theme in most of the papers is the interplay between randomness and computation. This interplay is pivotal to some parts of complexity theory and is essential for local algorithms.Th…e works included address a variety of topics in the areas of complexity theory and local algorithms. Within complexity theory the topics include approximation algorithms, counting problems, enumeration problems, explicit construction of expander graphs, fine grained complexity, interactive proof systems, PPT-search and pseudodeterminism, space complexity, and worst-case to average-case reductions. Within local algorithms the focus is mostly on property testing and on locally testable and decodable codes. In particular, many of the works seek to advance the study of testing graph properties in the bounded-degree graph model. Other topics in property testing include testing group properties and testing properties of affine subspaces. This volume contains a collection of studies in the areas of complexity theory and local algorithms. Other topics in property testing include testing group properties and testing properties of affine subspaces. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
US$ 147.23
US$ 11.55 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 102.35
US$ 69.66 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This volume contains a collection of studies in the areas of complexity theory and local algorithms. A common theme in most of the papers is the interplay between randomness and computation. This interplay is pivotal to some parts of co…mplexity theory and is essential for local algorithms.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 464 pp. Englisch.
