STOC/FOCS Bibliography PDF Download

Author: David S. Johnson
Publisher:
ISBN:
Category : ACM Symposium on Theory of Computing
Languages : en
Pages : 332

View

Book Description

Author: Sanjeev Arora
Publisher: Cambridge University Press
ISBN: 1139477366
Category : Computers
Languages : en
Pages : 519

View

Book Description
This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem.

Author: Arto Salomaa
Publisher: Springer Science & Business Media
ISBN: 3662026279
Category : Computers
Languages : en
Pages : 251

View

Book Description
Cryptography, secret writing, is probably as old as writing itself. But only recently has it become the object of extensive scientific studies. Vast new applications to data security are one explanation for this. Perhaps a more important reason for the huge growth of scientific research on cryptography is the seminal idea of public-key cryptography and the resulting new vistas on the possibilities of communication. This book gives a broad overview of public-key cryptography, covering its essence and advantages, various public-key cryptosystems and protocols. It also gives a comprehensive introduction to classical cryptography and cryptanalysis. The book is self-contained and suitable both as a text and as a reference. It starts from the beginning but also includes some 1989 developments. The presentation is in many ways new, with some new results. The treatment is rigorous but avoids unnecessary formalism. The plaintext examples in the book form a package of basic sauna knowledge.

Author: Takashi Washio
Publisher: Springer Science & Business Media
ISBN: 3540354700
Category : Computers
Languages : en
Pages : 488

View

Book Description
This book presents the joint post-proceedings of five international workshops organized by the Japanese Society for Artificial Intelligence, during the 19th Annual Conference JSAI 2005. The volume includes 5 award winning papers of the main conference, along with 40 revised full workshop papers, covering such topics as logic and engineering of natural language semantics, learning with logics, agent network dynamics and intelligence, conversational informatics and risk management systems with intelligent data analysis.

Author: Ketan Mulmuley
Publisher: Prentice Hall
ISBN:
Category : Computers
Languages : en
Pages : 472

View

Book Description
For beginning graduate-level courses in computational geometry. This up-to-date and concise introduction to computational geometry with emphasis on simple randomized methods is designed for quick, easy access to beginners.

Author:
Publisher:
ISBN:
Category : Computer algorithms
Languages : en
Pages : 536

View

Book Description

Author:
Publisher:
ISBN:
Category : Mathematics
Languages : en
Pages : 676

View

Book Description

Author: Mauro Dell'Amico
Publisher:
ISBN:
Category : Mathematics
Languages : en
Pages : 520

View

Book Description
Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors Ronald L. Graham Jan Karel Lenstra Robert E. Tarjan Discrete Mathematics and Optimization involves the study of finite structures and is one of the fastest growing areas in mathematics today. The level and depth of recent advances in the area and the wide applicability of its evolving techniques point to the rapidity with which the field is moving and presage the ever-increasing interaction between it and computer science. The Series provides a broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, mathematical programming and the analysis of algorithms, and including such topics as Ramsey theory, transversal theory, block designs, finite geometries, Polya theory, graph and matroid algorithms, network flows, polyhedral combinatorics and computational complexity. The Wiley-Interscience Series in Discrete Mathematics and Optimization will be a substantial part of the record in this extraordinary development. Recent titles in the Series: Local Search in Combinatorial Optimization Edited by Emile H. L. Aarts Philips Research Laboratories, Eindhoven and Eindhoven University of Technology, Eindhoven Jan Karel Lenstra Eindhoven University of Technology, Eindhoven and CWI Amsterdam In the past three decades local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in a reasonable time. This area of discrete mathematics is of great practical use and is attracting ever-increasing attention. The contributions to this book cover local search and its variants from both a theoretical and practical point of view, each with a chapter written by leading authorities on that particular aspect. Chapters 1 to 7 deal with the theory of local search and describe the principal search strategies such as simulated annealing, tabu search, genetic algorithms and neural networks. The remaining chapters present a wealth of results on applications of local search to problems in management science and engineering, including the traveling salesman problem, vehicle routing, machine scheduling, VLSI design and code design. This book is an important reference volume and an invaluable source of inspiration for advanced students and researchers in discrete mathematics, computer science, operations research, industrial engineering and management science.

Author: Steven Rudich, Avi Wigderson
Publisher: American Mathematical Soc.
ISBN: 9780821886922
Category : Computational complexity
Languages : en
Pages : 410

View

Book Description
Computational Complexity Theory is the study of how much of a given resource is required to perform the computations that interest us the most. Four decades of fruitful research have produced a rich and subtle theory of the relationship between different resource measures and problems. At the core of the theory are some of the most alluring open problems in mathematics. This book presents three weeks of lectures from the IAS/Park City Mathematics Institute Summer School on computational complexity. The first week gives a general introduction to the field, including descriptions of the basic mo.

Author: Anup Rao
Publisher: Cambridge University Press
ISBN: 1108497985
Category : Computers
Languages : en
Pages : 271

View

Book Description
Presents basic theory for graduate students and researchers with applications in circuit and proof complexity, streaming algorithms and distributed computing.