Proceedings of the Seventh Annual Structure in Complexity Theory Conference
Author :
Publisher :
Page : 370 pages
File Size : 29,66 MB
Release : 1992
Category : Computational complexity
ISBN :
STACS 2006
Author : Bruno Durand
Publisher : Springer Science & Business Media
Page : 730 pages
File Size : 37,96 MB
Release : 2006-02-14
Category : Computers
ISBN : 3540323015
Book Description
This book constitutes the refereed proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, held in February 2006. The 54 revised full papers presented together with three invited papers were carefully reviewed and selected from 283 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, and logic in computer science.
Complexity Theory
Author : Lane A. Hemaspaandra
Publisher : Springer Science & Business Media
Page : 360 pages
File Size : 19,61 MB
Release : 1997-06-05
Category : Computers
ISBN : 9780387949734
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.
Complexity and Approximation
Author : Ding-Zhu Du
Publisher : Springer Nature
Page : 298 pages
File Size : 15,77 MB
Release : 2020-02-20
Category : Computers
ISBN : 3030416720
Book Description
This Festschrift is in honor of Ker-I Ko, Professor in the Stony Brook University, USA. Ker-I Ko was one of the founding fathers of computational complexity over real numbers and analysis. He and Harvey Friedman devised a theoretical model for real number computations by extending the computation of Turing machines. He contributed significantly to advancing the theory of structural complexity, especially on polynomial-time isomorphism, instance complexity, and relativization of polynomial-time hierarchy. Ker-I also made many contributions to approximation algorithm theory of combinatorial optimization problems. This volume contains 17 contributions in the area of complexity and approximation. Those articles are authored by researchers over the world, including North America, Europe and Asia. Most of them are co-authors, colleagues, friends, and students of Ker-I Ko.
Logic and Computational Complexity
Author : Daniel Leivant
Publisher : Springer Science & Business Media
Page : 534 pages
File Size : 37,15 MB
Release : 1995-08-02
Category : Computers
ISBN : 9783540601784
Book Description
This book contains revised versions of papers invited for presentation at the International Workshop on Logic and Computational Complexity, LCC '94, held in Indianapolis, IN in October 1994. The synergy between logic and computational complexity has gained importance and vigor in recent years, cutting across many areas. The 25 revised full papers in this book contributed by internationally outstanding researchers document the state-of-the-art in this interdisciplinary field of growing interest; they are presented in sections on foundational issues, applicative and proof-theoretic complexity, complexity of proofs, computational complexity of functionals, complexity and model theory, and finite model theory.
STACS 2000
Author : Horst Reichel
Publisher : Springer
Page : 676 pages
File Size : 36,73 MB
Release : 2007-08-03
Category : Computers
ISBN : 3540465413
Book Description
This book constitutes the refereed proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, held in Lille, France in February 2000. The 51 revised full papers presented together with the three invited papers were carefully reviewed and selected from a total of 146 submissions on the basis of some 700 reviewers' reports. The papers address fundamental issues from all current areas of theoretical computer science including algorithms, data structures, automata, formal languages, complexity, verification, logic, cryptography, graph theory, optimization, etc.
The Multivariate Algorithmic Revolution and Beyond
Author : Hans L. Bodlaender
Publisher : Springer
Page : 521 pages
File Size : 11,78 MB
Release : 2012-06-16
Category : Computers
ISBN : 3642308910
Book Description
Parameterized complexity is currently a thriving field in complexity theory and algorithm design. A significant part of the success of the field can be attributed to Michael R. Fellows. This Festschrift has been published in honor of Mike Fellows on the occasion of his 60th birthday. It contains 20 papers that showcase the important scientific contributions of this remarkable man, describes the history of the field of parameterized complexity, and also reflects on other parts of Mike Fellows’s unique and broad range of interests, including his work on the popularization of discrete mathematics for young children. The volume contains several surveys that introduce the reader to the field of parameterized complexity and discuss important notions, results, and developments in this field.
Algorithms - ESA '93
Author : Thomas Lengauer
Publisher : Springer Science & Business Media
Page : 434 pages
File Size : 33,10 MB
Release : 1993-09-21
Category : Computers
ISBN : 9783540572732
Book Description
Symposium on Algorithms (ESA '93), held in Bad Honnef, near Boon, in Germany, September 30 - October 2, 1993. The symposium is intended to launchan annual series of international conferences, held in early fall, covering the field of algorithms. Within the scope of the symposium lies all research on algorithms, theoretical as well as applied, that is carried out in the fields of computer science and discrete applied mathematics. The symposium aims to cater to both of these research communities and to intensify the exchange between them. The volume contains 35 contributed papers selected from 101 proposals submitted in response to the call for papers, as well as three invited lectures: "Evolution of an algorithm" by Michael Paterson, "Complexity of disjoint paths problems in planar graphs" by Alexander Schrijver, and "Sequence comparison and statistical significance in molecular biology" by Michael S. Waterman.
Theoretical Computer Science - Proceedings Of The Fifth Italian Conference
Author : Alfredo De Santis
Publisher : World Scientific
Page : 577 pages
File Size : 16,30 MB
Release : 1996-04-13
Category : Computers
ISBN : 9814547832
Book Description
The Fifth Italian Conference on Theoretical Computer Science covers all aspects of Theoretical Computer Science. Among the topics addressed in the volume are Algorithms, Concurrency, Automata, Formal Languages, Computational Complexity, Temporal and Model Logic, Logic Programming, and λ-Calculus.The proceedings include 33 selected papers and three distinguished invited lectures by Michael Luby, Ugo Montanari and Alberto Bertoni.
Rules and Reasoning
Author : Paul Fodor
Publisher : Springer Nature
Page : 221 pages
File Size : 25,94 MB
Release : 2019-09-13
Category : Mathematics
ISBN : 3030310957
Book Description
This book constitutes the proceedings of the International Joint Conference on Rules and Reasoning, RuleML+RR 2019, held in Bolzano, Italy, during September 2019. This is the third conference of a new series, joining the efforts of two existing conference series, namely “RuleML” (International Web Rule Symposium) and “RR” (Web Reasoning and Rule Systems). The 10 full research papers presented together with 5 short technical communications papers were carefully reviewed and selected from 26 submissions.
