"Proof Verification and the Hardness of Approximation Problems."

Sanjeev Arora et al. (1998)

> Home

Details and statistics

DOI: 10.1145/278298.278306

access: closed

type: Journal Article

metadata version: 2022-06-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/AroraLMSS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/AroraLMSS98
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy:
Proof Verification and the Hardness of Approximation Problems. J. ACM 45(3): 501-555 (1998)

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.