TCS
2011
12 years 11 months ago
2011
Abstract. We consider the complexity of the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. The problem was supposed to be computat...
TCS
2011
12 years 11 months ago
2011
In this paper, we introduce block insertion and deletion on trajectories, which provide us with a new framework to study properties of language operations. With the parallel synta...
TCS
2011
12 years 11 months ago
2011
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...
TCS
2011
12 years 11 months ago
2011
How should a seller price her goods in a market where each buyer prefers a single good among his desired goods, and will buy the cheapest such good, as long as it is within his bu...
TCS
2011
12 years 11 months ago
2011
TCS
2011
12 years 11 months ago
2011
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
TCS
2011
12 years 11 months ago
2011
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
TCS
2011
12 years 11 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
TCS
2011
12 years 11 months ago
2011
We prove that if a set X ⊆ Z2 weakly self-assembles at temperature 1 in a deterministic (Winfree) tile assembly system satisfying a natural condition known as pumpability, then ...
TCS
2011
12 years 11 months ago
2011