Marknadens största urval
Fri frakt över 199 kr
Snabb leverans
Hjälp
Logga in
  1. Hem
  2. Böcker
  3. Företagande & lärande
  4. Data & IT
  5. Bounded Arithmetic, Propositional Logic and Complexity Theory

Bounded Arithmetic, Propositional Logic and Complexity Theory

av Jan (Academy of Sciences of the Czech Republic Krajicek

del av Encyclopedia of Mathematics and its Applications-serien

Bounded Arithmetic, Propositional Logic and Complexity Theory av Jan (Academy of Sciences of the Czech Republic Krajicek
Om Bounded Arithmetic, Propositional Logic and Complexity Theory

An up-to-date, unified treatment of research in this interdisciplinary subject, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and computational complexity theory and lists a number of intriguing open problems.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9780521452052
  • Format:
  • Inbunden
  • Sidor:
  • 360
  • Utgiven:
  • 24 November 1995
  • Mått:
  • 236x159x31 mm.
  • Vikt:
  • 672 g.
  Fri leverans
Leveranstid: 2-4 veckor
Förväntad leverans: 6 Augusti 2024

Om Jan (Academy of Sciences of the Czech Republic Krajicek

Se alla böcker av Jan (Academy of Sciences of the Czech Republic Krajicek

Beskrivning av Bounded Arithmetic, Propositional Logic and Complexity Theory

An up-to-date, unified treatment of research in this interdisciplinary subject, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and computational complexity theory and lists a number of intriguing open problems.

Användarnas betyg av Bounded Arithmetic, Propositional Logic and Complexity Theory



Andra köpte även...
Hitta liknande böcker
Boken Bounded Arithmetic, Propositional Logic and Complexity Theory finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.