127
click to vote
STACS
15 years 6 months ago
2001 Springer 
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames a...
110
click to vote
STACS
15 years 6 months ago
2001 Springer 
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
119
click to vote
STACS
15 years 6 months ago
2001 Springer
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
132
click to vote
STACS
15 years 6 months ago
2001 Springer 
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
118
click to vote
STACS
15 years 6 months ago
2001 Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
|
Theoretical Computer Science