Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

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

inglise keel
2011-08-31
42,32 € 70,53 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

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 ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor Ji¿í Hanika
Kirjastaja LAP LAMBERT Academic Publishing
Väljalaskeaasta 2011
Kaanetüüp Pehme kaanega
EAN 9783845408347
Kirjuta oma arvustus
Te vaatate: Search Problems and Bounded Arithmetic: Between Computational Complexity and Logic
Teie hinnang:

Goodreads'i arvustused

42,32 € 70,53 €