"Logical strength of complexity theory and a formalization of the PCP ..."

Ján Pich (2015)

> Home

Details and statistics

DOI: 10.2168/LMCS-11(2:8)2015

access: open

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI (open access)
  - electronic edition @ arxiv.org (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/Pich14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/Pich14
Ján Pich:
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic. Log. Methods Comput. Sci. 11(2) (2015)

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.