http://compalg.inf.elte.hu/~tony/Kutatas/BinPacking/Johnson-BinPacking-NP-Column-JAlg-2002.pdf

The NP-completeness column: An ongoing guide

This volume provides an ideal introduction to key topics in parallel computing. With its cogent overview of the essentials of the subject as well as lists of P -complete- and open problems, extensive remarks corresponding to each problem, a thorough index, and extensive references, the book will prove invaluable to programmers stuck on problems that are particularly difficult to parallelize. In providing an up-to-date survey of parallel computing research from 1994, Topics in Parallel Computing will prove invaluable to researchers and professionals with an interest in the super computers of the future.

/pdf/limits-to-parallel-computation-p-completeness-theory-2vkk1tcpy5.pdf

Limits to Parallel Computation: P-Completeness Theory

Classes of machines using very limited amounts of nondeterminism are studied. The P=? NP question is related to questions about classes lying within P. Complete sets for these classes are given.

/pdf/nondeterminism-within-p-25h9q76njc.pdf

Nondeterminism within P

One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computation time as a function of the size of input. We describe a system to derive such time bounds automatically using abstract interpretation. The semantics-based setting makes it possible to prove the correctness of the time bound function. The system can analyse programs in a first-order subset of Lisp and we show how the system also can be used to analyse programs in other languages.

Automatic complexity analysis

Cost analysis of object-oriented bytecode programs

A “pebble game” is introduced and some restricted pebble games are considered. It is shown that in each of these games the problem to determine whether there is a winning strategy (two-person game) is harder than the solvability problem (one-person game). We also show that each of these problems is complete in well-known complexity classes. Several familiar games are presented whose winning strategy problems are complete in exponential time.

Classes of Pebble Games and Complete Problems

Dans cet article, on considere quelques problemes combinatoires et on etablit des problemes «naturels» dans P, pour la reconnaissance dont les limites inferieures en temps polynomial peuvent etre connues. Introduction du «jeu de galet» et on montre que quelques-uns de ces problemes peuvent etre complets dans certaines classes de complexite

Some combinatorial game problems require Ω(nk) time

A “pebble game” is introduced and some restricted pebble games are considered. It is shown that in each of these games the problem to determine whether there is a winning strategy (two-person game) is harder than the solvability problem (one-person game). We also show that each of these problems is complete in well known complexity classes.

Akeo Adachi

Papers

Classes of Pebble Games and Complete Problems

Some combinatorial game problems require Ω(nk) time

Classes of pebble games and complete problems

A characterization of time complexity by simple loop programs

A theoretical study on the time analysis of programs