WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/30774504

Efficient checking of polynomials and proofs and the hardness of approximation problems

This work is a fascinating piece of research in computer science: it is built on and combines deep theoretical results from various areas and, at the same time, takes into account applications to hard problems in several fields. The author provides important new foundational insights and essentially 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.

Open All Close All

type

about

http://schema.org/about

author

contributor

creator

description

http://schema.org/description

  • "This work is a fascinating piece of research in computer science: it is built on and combines deep theoretical results from various areas and, at the same time, takes into account applications to hard problems in several fields. The author provides important new foundational insights and essentially 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."@en
  • "This work is a fascinating piece of research in computer science: it is built on and combines deep theoretical results from various areas and, at the same time, takes into account applications to hard problems in several fields. The author provides important new foundational insights and essentially 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."
  • "The definition of the class NP (Coo71, Lev73) highlights the problem of verification of proofs as one of central interest to theoretical computer science. Recent efforts have shown that the efficiency of the verification can be greatly improved by allowing the verifier access to random bits and accepting probabilistic guarantees from the verifier (BFL91, BFLS91, FGL$\sp+$91, AS92). We improve upon the efficiency of the proof systems developed above and obtain proofs which can be verified probabilistically by examining only a constant number of (randomly chosen) bits of the proof."@en

genre

http://schema.org/genre

  • "Electronic books"@en
  • "Academic theses"@en

name

http://schema.org/name

  • "Efficient checking of polynomials and proofs and the hardness of approximation problems"@it
  • "Efficient checking of polynomials and proofs and the hardness of approximation problems"@en
  • "Efficient checking of polynomials and proofs and the hardness of approximation problems"
  • "Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems"
  • "EFFICIENT CHECKING OF POLINOMIALS AND PROOFS AND THE HARDNESS OF APPROXIMATION PROBLEMS"
  • "Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems"

workExample