Cargando…

Bounded arithmetic, propositional logic and complexity theory

Discusses the deep connections between logic and complexity theory, and lists a number of intriguing open problems.

Detalles Bibliográficos
Autor principal: Krajicek, Jan
Lenguaje:eng
Publicado: Cambridge University Press 1995
Materias:
Acceso en línea:http://cds.cern.ch/record/1625307
_version_ 1780933639746355200
author Krajicek, Jan
author_facet Krajicek, Jan
author_sort Krajicek, Jan
collection CERN
description Discusses the deep connections between logic and complexity theory, and lists a number of intriguing open problems.
id cern-1625307
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 1995
publisher Cambridge University Press
record_format invenio
spelling cern-16253072021-04-21T21:42:26Zhttp://cds.cern.ch/record/1625307engKrajicek, JanBounded arithmetic, propositional logic and complexity theoryMathematical Physics and Mathematics Discusses the deep connections between logic and complexity theory, and lists a number of intriguing open problems.Cambridge University Pressoai:cds.cern.ch:16253071995
spellingShingle Mathematical Physics and Mathematics
Krajicek, Jan
Bounded arithmetic, propositional logic and complexity theory
title Bounded arithmetic, propositional logic and complexity theory
title_full Bounded arithmetic, propositional logic and complexity theory
title_fullStr Bounded arithmetic, propositional logic and complexity theory
title_full_unstemmed Bounded arithmetic, propositional logic and complexity theory
title_short Bounded arithmetic, propositional logic and complexity theory
title_sort bounded arithmetic, propositional logic and complexity theory
topic Mathematical Physics and Mathematics
url http://cds.cern.ch/record/1625307
work_keys_str_mv AT krajicekjan boundedarithmeticpropositionallogicandcomplexitytheory