topmenu
Wyniki wyszukiwania:
wyszukanych pozycji: 6
 |
The Complexity Theory Companion
ISBN: 9783540674191 / Angielski / Twarda / 2001 / 372 str. Termin realizacji zamówienia: ok. 20 dni roboczych. Invitation Invitation Secret Secret 1 1 Algorithms Algorithms are are at at the the heart heart of of complexity complexity theory. theory. That That is is the the dark dark secret secret of of complexity complexity theory. theory. It It is is recognized recognized by by complex- complex- ity ity theorists, theorists, but but would would be be literally literally incredible incredible to to most most others. others. In In this this book, book, we we hope hope to to make make this this secret secret credible. credible. In In fact, fact, the the real real secret secret is is even even more more...
Invitation Invitation Secret Secret 1 1 Algorithms Algorithms are are at at the the heart heart of of complexity complexity theory. theory. That That ...
|
cena:
310,55 zł |
 |
The Complexity Theory Companion
ISBN: 9783642086847 / Angielski / Miękka / 2010 / 372 str. Termin realizacji zamówienia: ok. 20 dni roboczych. Invitation Invitation Secret Secret 1 1 Algorithms Algorithms are are at at the the heart heart of of complexity complexity theory. theory. That That is is the the dark dark secret secret of of complexity complexity theory. theory. It It is is recognized recognized by by complex- complex- ity ity theorists, theorists, but but would would be be literally literally incredible incredible to to most most others. others. In In this this book, book, we we hope hope to to make make this this secret secret credible. credible. In In fact, fact, the the real real secret secret is is even even more more...
Invitation Invitation Secret Secret 1 1 Algorithms Algorithms are are at at the the heart heart of of complexity complexity theory. theory. That That ...
|
cena:
221,26 zł |
 |
Theory of Semi-Feasible Algorithms
ISBN: 9783642075810 / Angielski / Miękka / 2010 / 150 str. Termin realizacji zamówienia: ok. 20 dni roboczych. The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the theory of semi-feasible algorithms. In doing so it demonstrates the richness inherent in central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. The book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science. Another aim of this book is to lay out a path along which the reader can quickly reach the frontiers of current research, and...
The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the t...
|
cena:
388,20 zł |
 |
Complexity Theory Retrospective II
ISBN: 9781461273196 / Angielski / Miękka / 2012 / 339 str. Termin realizacji zamówienia: ok. 20 dni roboczych. This volume provides a survey of the subject in the form of a collection of articles written by experts, that together provides a comprehensive guide to research. The editors'aim has been to provide an accessible description of the current stae of complexity theory, and to demonstrate the breadth of techniques and results that make this subject so exciting. Thus, papers run the gamut from sublogarithmic space to exponential time, and from new combinatorial techniques to interactive proof systems.
This volume provides a survey of the subject in the form of a collection of articles written by experts, that together provides a comprehensive guide ...
|
cena:
194,08 zł |
 |
Complexity Theory Retrospective II
ISBN: 9780387949734 / Angielski / Twarda / 1997 / 339 str. Termin realizacji zamówienia: ok. 20 dni roboczych. Readers of Complexity Theory Retrospective (published by Springer-Verlag in 1990) will remember that the collection consisted primarily of articles that first ap- peared in preliminary form at one of the meetings of the Annual IEEE Conference on Structure in Complexity Theory. In particular, Complexity Theory Retrospective contained final versions of high-quality technical expository presentations, includ- ing talks that honored Juris Hartmanis on the occasion of his sixtieth birthday. We began planning for the current collection some months before the scheduled meeting in 1994 of the Tenth...
Readers of Complexity Theory Retrospective (published by Springer-Verlag in 1990) will remember that the collection consisted primarily of articles th...
|
cena:
194,08 zł |
 |
Theory of Semi-Feasible Algorithms
ISBN: 9783540422006 / Angielski / Twarda / 2002 / 150 str. Termin realizacji zamówienia: ok. 20 dni roboczych. An Invitation to the Dance It is an underappreciated fact that sets may have various types of complex ity, and not all types are in harmony with each other. The primary goal of this book is to unify and make more widely accessible a vibrant stream of research-the theory of semi-feasible computation-that perfectly showcases the richness of, and contrasts between, the central types of complexity. The semi-feasible sets, which are most commonly referred to as the P selective sets, are those sets L for which there is a deterministic polynornial time algorithm that, when given as input any two...
An Invitation to the Dance It is an underappreciated fact that sets may have various types of complex ity, and not all types are in harmony with each ...
|
cena:
388,20 zł |
Czytaj nas na:
Zobacz: Księgarnia Czeska | Wydawnictwo Książkowe Klimaty | Mapa strony | Lista autorów
KrainaKsiazek.PL - Księgarnia Internetowa
KrainaKsiazek.PL - Księgarnia Internetowa
