Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

Search Problems and Bounded Arithmetic: Between Computational Complexity and Logic - Ji¿í Hanika

Anglų
2011-08-31
52,90 € 70,53 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 15-21 d.d.

30 dienų grąžinimo politika

In the intersection of mathematical logic and computer science, this book investigates the search problems and reducibilities among them that have known or potential relevance to bounded arithmetic theories. The same structures are viewed from two very different angles: that of computational complexity, and that of sets of low complexity consequences of weak logical theories, bounded arithmetics. Two distin ... Visas aprašymas

Jums taip pat gali patikti

Aprašymas

In the intersection of mathematical logic and computer science, this book investigates the search problems and reducibilities among them that have known or potential relevance to bounded arithmetic theories. The same structures are viewed from two very different angles: that of computational complexity, and that of sets of low complexity consequences of weak logical theories, bounded arithmetics. Two distinct techniques of characterization of such sets by search problems are presented, with Herbrand's theorem at the root of both. Additional attention is paid to search problems from the minimization family, although their logical counterparts are mostly still to be discovered. In this way, the two worlds throw light onto each other.

Daugiau informacijos

Autorius Ji¿í Hanika
Leidėjas LAP LAMBERT Academic Publishing
Išleidimo metai 2011
Viršelio tipas Minkšti viršeliai
EAN 9783845408347
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Search Problems and Bounded Arithmetic: Between Computational Complexity and Logic
Jūsų įvertinimas:

Goodreads Atsiliepimai

52,90 € 70,53 €