Linear-time algorithms for NP-complete problems restricted t...

by Petra Scheffler

Introduction to automata theory, languages, and computation

by John E. Hopcroft, Jeffrey D. Ullman

Ten years ago the authors undertook to produce a book covering the known material on formal languages, automata theory, ...

An NP-complete matching problem

by David A. Plaisted

Approaches to coping with NP-completeness in sequencing prob...

by Brian Thomas Eck

Languages and machines

by Thomas A. Sudkamp

NP-Completeness for Algebra and Number Theory, Games and Puz...

by Daljit S. Jandu

Data structures and algorithm analysis in C

by Mark Allen Weiss

The Golden Ticket

by Lance Fortnow

Complexity and real computation

by Lenore Blum

Algorithmic complexityand communication problems

by J.-P Barthélemy

Problèmes d'ordonnancement

by Jacques Carlier, Philippe Chrétienne

Algorithmic complexity and communication problems

by Jean-Pierre Barthelemy, J-P Barthelmy

Efficient checking of polynomials and proofs and the hardnes...

by Madhu Sudan

Theory of computation

by Derick Wood

Neural networks

by Berndt Müller, Joachim Reinhardt

Although the human central nervous system has been studied by medical doctors ever since the late Middle Ages, its detai...

Slice functions and the method of approximations

by J. Vincent Gogan

Average-case complexity

by Andrej Bogdanov, Luca Trevisan

Slozhnostʹ zadachi razbieni͡ia mnozhestva nuleĭ bulevoĭ funk...

by K. V. Zado͡ian

Graph-Theoretic Concepts in Computer Science

by Alberto Marchetti-Spaccamela

It is widely known that many NP-complete graph problems remain NP-complete even if restricted to bounded degree and regu...

Graph-Theoretic Concepts in Computer Sciences

by Jan van Leeuwen

The class of graphs with treewidth  k has the property that many graph problems, which are NP-complete for arbitrary gr...