"Efficient Checking of Polynomials and Proofs anf the Hardness of ..."

Madhu Sudan (1995)

> Home

Details and statistics

DOI: 10.1007/3-540-60615-7

access: closed

type: Book or Thesis

metadata version: 2022-06-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - books/sp/Sudan95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/sp/Sudan95
Madhu Sudan:
Efficient Checking of Polynomials and Proofs anf the Hardness of Approximation Problems. Lecture Notes in Computer Science 1001, Springer 1995, ISBN 3-540-60615-7

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.