› › 1995 Ieee Structure In Complexity Theory

Complexity Theory

Author : Lane A. Hemaspaandra

Publisher : Springer Science & Business Media

Page : 360 pages

File Size : 21,68 MB

Release : 1997-06-05

Category : Computers

ISBN : 9780387949734

Get eBook

Book Description

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.





Mathematical Foundations of Computer Science 1995

Author : Juraj Wiedermann

Publisher : Springer Science & Business Media

Page : 614 pages

File Size : 45,76 MB

Release : 1995-08-16

Category : Computers

ISBN : 9783540602460

Get eBook

Book Description

This book presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MFCS'95, held in Prague, Czech Republic in August/September 1995. The book contains eight invited papers and two abstracts of invited talks by outstanding scientists as well as 44 revised full research papers selected from a total of 104 submissions. All relevant aspects of theoretical computer science are addressed, particularly the mathematical foundations; the papers are organized in sections on structural complexity, algorithms, complexity theory, graphs in models of computation, lower bounds, formal languages, unification, rewriting and type theory, distributed computation, concurrency, semantics, model checking, and formal calculi.



Complexity, Logic, and Recursion Theory

Author : Andrea Sorbi

Publisher : CRC Press

Page : 380 pages

File Size : 45,51 MB

Release : 2019-05-07

Category : Mathematics

ISBN : 1482269759

Get eBook

Book Description

"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."



Mathematical Foundations of Computer Science 2005

Author : Joanna Jedrzejowicz

Publisher : Springer Science & Business Media

Page : 829 pages

File Size : 48,23 MB

Release : 2005-08-17

Category : Computers

ISBN : 3540287027

Get eBook

Book Description

This book constitutes the refereed proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, MFCS 2005, held in Gdansk, Poland in August/September 2005. The 62 revised full papers presented together with full papers or abstracts of 7 invited talks were carefully reviewed and selected from 137 submissions. All current aspects in theoretical computer science are addressed, ranging from quantum computing, approximation, automata, circuits, scheduling, games, languages, discrete mathematics, combinatorial optimization, graph theory, networking, algorithms, and complexity to programming theory, formal methods, and mathematical logic.



STACS 95

Author : Ernst W. Mayr

Publisher : Springer Science & Business Media

Page : 698 pages

File Size : 45,97 MB

Release : 1995-02-15

Category : Computers

ISBN : 9783540590422

Get eBook

Book Description

This 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.



Frontiers in Algorithmics

Author : Jianer Chen

Publisher : Springer

Page : 322 pages

File Size : 14,59 MB

Release : 2018-05-01

Category : Computers

ISBN : 3319784552

Get eBook

Book Description

This book constitutes the refereed proceedings of the 12th International Workshop on Frontiers in Algorithmics, FAW 2018, held in Guangzhou, China, in May 2018.The 23 full papers presented in this volume were carefully reviewed and selected from 38 submissions. The papers of this workshop provide a focused forum on current trends of research on algorithms, discrete structures, and their applications.



The Complexity Theory Companion

Author : Lane A. Hemaspaandra

Publisher : Springer Science & Business Media

Page : 375 pages

File Size : 42,1 MB

Release : 2013-03-14

Category : Computers

ISBN : 3662048809

Get eBook

Book Description

Here is an accessible, algorithmically oriented guide to some of the most interesting techniques of complexity theory. The book shows that simple algorithms are at the heart of complexity theory. The book is organized by technique rather than by topic. Each chapter focuses on one technique: what it is, and what results and applications it yields.



Descriptive Complexity

Author : Neil Immerman

Publisher : Springer Science & Business Media

Page : 275 pages

File Size : 10,56 MB

Release : 2012-12-06

Category : Computers

ISBN : 1461205395

Get eBook

Book Description

By virtue of the close relationship between logic and relational databases, it turns out that complexity has important applications to databases such as analyzing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is a relatively self-contained introduction to the subject, which includes the necessary background material, as well as numerous examples and exercises.



Coding and Cryptology

Author : Yeow Meng Chee

Publisher : Springer

Page : 302 pages

File Size : 36,68 MB

Release : 2011-06-05

Category : Computers

ISBN : 3642209017

Get eBook

Book Description

This book constitutes the refereed proceedings of the Third International Workshop on Coding and Cryptology, IWCC 2011, held in Qingdao, China, May 30-June 3, 2011. The 19 revised full technical papers are contributed by the invited speakers of the workshop. The papers were carefully reviewed and cover a broad range of foundational and methodological as well as applicative issues in coding and cryptology, as well as related areas such as combinatorics.