Author: Jin-Yi Cai
Publisher: Cambridge University Press
ISBN: 1108508820
Category : Computers
Languages : en
Pages : 473
Get Book Here
Book Description
Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for broad classes of counting problems in the realm of P and NP. Classifications are proved for partition functions of spin systems, graph homomorphisms, constraint satisfaction problems, and Holant problems. The book assumes minimal prior knowledge of computational complexity theory, developing proof techniques as needed and gradually increasing the generality and abstraction of the theory. This volume presents the theory on the Boolean domain, and includes a thorough presentation of holographic algorithms, culminating in classifications of computational problems studied in exactly solvable models from statistical mechanics.
Author: Jin-yi Cai
Publisher:
ISBN: 9781107635609
Category : Algebra, Boolean
Languages : en
Pages :
Get Book Here
Book Description
Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for broad classes of counting problems in the realm of P and NP. Classifications are proved for partition functions of spin systems, graph homomorphisms, constraint satisfaction problems, and Holant problems. The book assumes minimal prior knowledge of computational complexity theory, developing proof techniques as needed and gradually increasing the generality and abstraction of the theory. This volume presents the theory on the Boolean domain, and includes a thorough presentation of holographic algorithms, culminating in classifications of computational problems studied in exactly solvable models from statistical mechanics
Author: Lizhen Ji
Publisher: American Mathematical Soc.
ISBN: 0821875876
Category : Mathematics
Languages : en
Pages : 522
Get Book Here
Book Description
This two-part volume represents the proceedings of the Fifth International Congress of Chinese Mathematicians, held at Tsinghua University, Beijing, in December 2010. The Congress brought together eminent Chinese and overseas mathematicians to discuss the latest developments in pure and applied mathematics. Included are 60 papers based on lectures given at the conference.
Author: Jin-Yi Cai
Publisher: Cambridge University Press
ISBN: 1107062373
Category : Computers
Languages : en
Pages : 473
Get Book Here
Book Description
Volume 1. Boolean domain
Author: Rahul Santhanam
Publisher: Springer Nature
ISBN: 3030794164
Category : Computers
Languages : en
Pages : 485
Get Book Here
Book Description
This book constitutes the proceedings of the 16th International Computer Science Symposium in Russia, CSR 2021, held in Sochi, Russia, in June/July 2021. The 28 full papers were carefully reviewed and selected from 68 submissions. The papers cover a broad range of topics, such as formal languages and automata theory, geometry and discrete structures; theory and algorithms for application domains and much more.
Author: Weili Wu
Publisher: Springer Nature
ISBN: 3031491904
Category : Computers
Languages : en
Pages : 424
Get Book Here
Book Description
This two volume set LNCS 14422-14423 constitutes the refereed proceedings of the 29th International Conference, COCOON 2023, held in Hawaii, HI, USA, during December 2023. The 60 full papers were carefully reviewed and selected from 146 submissions. They are organized in the following topical sections: Part I : Combinatorics and Algorithms; Algorithmic Solution in Applications; and Algorithm in Networks. Part II: Complexity and Approximation; Graph Algorithms; and Applied Algorithms.
Author: Evripidis Bampis
Publisher: Springer Nature
ISBN: 3030865932
Category : Computers
Languages : en
Pages : 476
Get Book Here
Book Description
This book constitutes the proceedings of the 23rd International Symposium on Fundamentals of Computation Theory, FCT 2021, held in Athens, Greece, in September 2021. The 30 full papers included in this volume were carefully reviewed and selected from 94 submissions. In addition, the book contains 2 invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.
Author: Kohei Arai
Publisher: Springer Nature
ISBN: 3031622731
Category :
Languages : en
Pages : 588
Get Book Here
Book Description
Author: Dimitris E. Simos
Publisher: Springer Nature
ISBN: 3030921212
Category : Mathematics
Languages : en
Pages : 423
Get Book Here
Book Description
This book constitutes the refereed post-conference proceedings on Learning and Intelligent Optimization, LION 15, held in Athens, Greece, in June 2021. The 30 full papers presented have been carefully reviewed and selected from 35 submissions. LION deals with designing and engineering ways of "learning" about the performance of different techniques, and ways of using past experience about the algorithm behavior to improve performance in the future. Intelligent learning schemes for mining the knowledge obtained online or offline can improve the algorithm design process and simplify the applications of high-performance optimization methods. Combinations of different algorithms can further improve the robustness and performance of the individual components.
Author: Avi Wigderson
Publisher: Princeton University Press
ISBN: 0691189137
Category : Computers
Languages : en
Pages : 434
Get Book Here
Book Description
From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography
