Structure in Complexity Theory
Author: Alan L. Selman
Publisher: Springer Science & Business Media
Published: 1986-05
Total Pages: 412
ISBN-13: 9783540164869
DOWNLOAD EBOOKPosts
Complexity Theory
Author: Lane A. Hemaspaandra
Publisher: Springer Science & Business Media
Published: 1997-06-05
Total Pages: 360
ISBN-13: 9780387949734
DOWNLOAD EBOOKThis 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.
Unifying Themes in Complex Systems
Author: Ali A. Minai
Publisher: Springer Science & Business Media
Published: 2007-08-06
Total Pages: 389
ISBN-13: 3540358668
DOWNLOAD EBOOKIn recent years, scientists have applied the principles of complex systems science to increasingly diverse fields. The results have been nothing short of remarkable. The Third International Conference on Complex Systems attracted over 400 researchers from around the world. The conference aimed to encourage cross-fertilization between the many disciplines represented and to deepen our understanding of the properties common to all complex systems.
1995 IEEE Structure in Complexity Theory
Author:
Publisher:
Published: 1995
Total Pages: 348
ISBN-13:
DOWNLOAD EBOOKComplexity Theory and Cryptology
Author: Jörg Rothe
Publisher: Springer Science & Business Media
Published: 2005-07-22
Total Pages: 488
ISBN-13: 3540221476
DOWNLOAD EBOOKModern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research topics in complexity theory are often motivated by questions and problems from cryptology. This book takes account of this situation, and therefore its subject is what may be dubbed "cryptocomplexity'', a kind of symbiosis of these two areas. This book is written for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Moreover, it may serve as a valuable source for researchers, teachers, and practitioners working in these fields. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges.
STACS 92
Author: Alain Finkel
Publisher: Springer Science & Business Media
Published: 1992-02-04
Total Pages: 644
ISBN-13: 9783540552109
DOWNLOAD EBOOKThis volume gives the proceedings of the ninth Symposium on Theoretical Aspects of Computer Science (STACS). This annual symposium is held alternately in France and Germany and is organized jointly by the Special Interest Group for Fundamental Computer Science of the Association Francaise des Sciences et Technologies de l'Information et des Syst mes (AFCET) and the Special Interest Group for Theoretical Computer Science of the Gesellschaft f}r Informatik (GI). The volume includes three invited lectures and sections on parallel algorithms, logic and semantics, computational geometry, automata and languages, structural complexity, computational geometry and learning theory, complexity and communication, distributed systems, complexity, algorithms, cryptography, VLSI, words and rewriting, and systems.
STACS 94
Author: Patrice Enjalbert
Publisher: Springer Science & Business Media
Published: 1994-02-09
Total Pages: 802
ISBN-13: 9783540577850
DOWNLOAD EBOOKThis volume constitutes the proceedings of the 11th annual Symposium on Theoretical Aspects of Computer Science (STACS '94), held in Caen, France, February 24-26, 1994. Besides three prominent invited papers, the proceedings contains 60 accepted contributions chosen by the international program committee during a highly competitive reviewing process from a total of 234 submissions for 38 countries. The volume competently represents most areas of theoretical computer science with a certain emphasis on (parallel) algorithms and complexity.
Complexity Theory Retrospective
Author: Alan L. Selman
Publisher: Springer Science & Business Media
Published: 2012-12-06
Total Pages: 242
ISBN-13: 1461244781
DOWNLOAD EBOOKIn 1965 Juris Hartmanis and Richard E. Stearns published a paper "On the Computational Complexity of Algorithms". The field of complexity theory takes its name from this seminal paper and many of the major concepts and issues of complexity theory were introduced by Hartmanis in subsequent work. In honor of the contribution of Juris Hartmanis to the field of complexity theory, a special session of invited talks by Richard E. Stearns, Allan Borodin and Paul Young was held at the third annual meeting of the Structure in Complexity conference, and the first three chapters of this book are the final versions of these talks. They recall intellectual and professional trends in Hartmanis' contributions. All but one of the remainder of the chapters in this volume originated as a presentation at one of the recent meetings of the Structure in Complexity Theory Conference and appeared in preliminary form in the conference proceedings. In all, these expositions form an excellent description of much of contemporary complexity theory.
STACS 95
Author: Ernst W. Mayr
Publisher: Springer Science & Business Media
Published: 1995-02-15
Total Pages: 698
ISBN-13: 9783540590422
DOWNLOAD EBOOKThis book presents the proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS 95), held in Munich, Germany in March 1995. Besides three invited talks, the book contains revised versions of 53 research papers selected from a total of 180 submissions. The contributions address all current aspects of theoretical computer science; they are organized in sections on complexity theory, automata theory, algorithms, logic, theory of parallel computing, communication theory, graph theory and databases, and computational geometry.
Theory of Semi-Feasible Algorithms
Author: Lane A. Hemaspaandra
Publisher: Springer Science & Business Media
Published: 2013-04-17
Total Pages: 156
ISBN-13: 3662050803
DOWNLOAD EBOOKThe 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 meet and engage the many exciting open problems in this area.
