This article surveys various complexity and expressiveness results on different forms of logic
programming. The main focus is on decidable forms of logic programming, in particular …

Decidability and complexity of Petri net problems — An introduction Page 1
Decidability and Complexity of Petri Net Problems An Introduction* Javier Esparza Institut fiir …

Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

Automata, Computability, and Complexity 1/Complexity theory 2/Computability theory
2/Automata theory 3/Mathematical Notions and Terminology 3/Sets 3/Sequences and tuples …

The idea for this book was conceived over the second bottle of Villa Maria's Caber net
Medot'89, at the dinner of the Australasian Combinatorics Conference held at Palmerston …

A brilliant treatment of a knotty problem in computing. This volume contains chapters written
by reputable researchers and provides the state of the art in theory and algorithms for the …

Classical complexity theory analyzes and classifies problems by the amount of a resource,
usually time or space, that is required by algorithms solving them. It was a fundamental idea …

The need for a comprehensive survey-type exposition on formal languages and related
mainstream areas of computer science has been evident for some years. In the early 1970s …

N COMPUTER applications we are used to live with approximation. Var I ious notions of
approximation appear, in fact, in many circumstances. One notable example is the type of …

A basic issue in computer science is the complexity of problems. Computational complexity
measures how much time or memory is needed as a function of the input problem size …