Open AccessBook
Introduction to the theory of complexity
TLDR
1. Mathematical Preliminaries, Elements of Computability Theory, and Space-Complexity Classes: Algorithms and Complexity Classes.Abstract:
1. Mathematical Preliminaries. 2. Elements of Computability Theory. 4. The Class P. 5. The Glass NP. 6. The Complexity of Optiimzation Problems. 7. Beyond NP. 8. Space-Complexity Classes. 9. Probabiillistic. 10. Algorithms and Complexity Classes. 11. Interactivite Proof. 12. Systems. 13. Models of Parallel Computer. 14. Parallel Algorithms.read more
Citations
More filters
Book ChapterDOI
The knowledge complexity of interactive proof-systems
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies arc not made or distributed for direct commercial advantage.
Book ChapterDOI
The maximum clique problem
TL;DR: A survey of results concerning algorithms, complexity, and applications of the maximum clique problem is presented and enumerative and exact algorithms, heuristics, and a variety of other proposed methods are discussed.
BookDOI
Complexity and Approximation
Giorgio Ausiello,Alberto Marchetti-Spaccamela,Pierluigi Crescenzi,Giorgio Gambosi,Marco Protasi,Viggo Kann +5 more
MonographDOI
Introduction to Parallel Computing
TL;DR: In this article, a comprehensive introduction to parallel computing is provided, discussing theoretical issues such as the fundamentals of concurrent processes, models of parallel and distributed computing, and metrics for evaluating and comparing parallel algorithms, as well as practical issues, including methods of designing and implementing shared-and distributed-memory programs, and standards for parallel program implementation.
BookDOI
Handbook of Computational Social Choice
TL;DR: This handbook, written by thirty-six prominent members of the computational social choice community, covers the field comprehensively and offers detailed introductions to each of the field's major themes.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.