Login / Signup

Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic.

Ján Pich
Published in: Log. Methods Comput. Sci. (2015)
Keyphrases
  • complexity theory
  • theoretical basis
  • computational geometry
  • logical framework
  • logical language
  • formal model
  • feature selection
  • object recognition
  • knowledge representation
  • supervised learning
  • continuous functions