Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems

Name: Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
SKU: 2820871
Price: 149.00 NZD
Availability: InStock

Format:

Paperback / softback

Series:

Lecture Notes in Computer Science,

Show Hide Adult Content

$149.00

Available from supplier

Usually ships in 3-4 weeks

0 in Trolley

Price Match

Wrap this item as a gift ($5.90) - add a free gift card on the next page

Free Delivery with Primate

Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $37.25 with Afterpay Learn more

6 weekly interest-free payments of $24.83 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

Around 18-28 June using International Courier

Description

This book is based on the author's PhD thesis which was selected as the winning thesis of the 1993 ACM Doctoral Dissertation Competition. The author improved the presentation and included the progress achieved since the thesis was approved by the University of California at Berkeley. This work is a fascinating piece of theoretical computer science research building on deep results from different areas. It provides new theoretical insights and advances applicable techniques in such different areas as computational complexity, efficient (randomized) checking of proofs, programs and polynomials, approximation algorithms, NP-complete optimization, and error-detection and error-correction algorithms in coding theory.

Release date NZ

December 13th, 1995

Audiences

Postgraduate, Research & Scholarly
Professional & Vocational

Contributor

Edited by Madhu Sudan

Illustrations

XIV, 94 p.

Pages

Series

Lecture Notes in Computer Science,

Dimensions

156x234x5

ISBN-13

9783540606154

Product ID

2820871

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Get free delivery, exclusive deals, and more^*

Non-Fiction Books:

Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems

Format:

Series:

Buy Now, Pay Later with:

Availability

Description

Customer reviews

Marketplace listings

Help & options

Filed under...

Get free delivery, exclusive deals, and more*

Buy Now, Pay Later with:

Get free delivery, exclusive deals, and more^*