114
click to vote
MFCS
15 years 6 months ago
2007 Springer 
In this paper we study language recognition by two-dimensional cellular automata on different possible neighborhoods. Since it is known that all complete neighborhoods are linearl...
104
click to vote
MFCS
15 years 6 months ago
2007 Springer 
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
MFCS
15 years 6 months ago
2007 Springer 
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
101
click to vote
MFCS
15 years 6 months ago
2007 Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
MFCS
15 years 6 months ago
2007 Springer 
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
|
Theoretical Computer Science