Sciweavers

220 search results - page 13 / 44
» tcs 2008
Sort
View
TCS
2002
14 years 11 months ago
MAX3SAT is exponentially hard to approximate if NP has positive dimension
Under the hypothesis that NP has positive p-dimension, we prove that any approximation algorithm A for MAX3SAT must satisfy at least one of the following:
John M. Hitchcock
TCS
2002
14 years 11 months ago
Augmenting the discrete timed automaton with other data structures
We describe a general automata-theoretic approach for analyzing the veri
Oscar H. Ibarra, Jianwen Su
TCS
2002
14 years 11 months ago
A guide to membrane computing
Membrane systems are models of computation which are inspired by some basic features of biological membranes. In a membrane system multisets of objects are placed in the compartme...
Gheorghe Paun, Grzegorz Rozenberg
TCS
2002
14 years 11 months ago
Coding rotations on intervals
We show that the coding of a rotation by on m intervals can be recoded over m Sturmian words of angle . c 2002 Elsevier Science B.V. All rights reserved.
Jean Berstel, Laurent Vuillon
TCS
2008
14 years 12 months ago
A finite set of functions with an EXPTIME-complete composition problem
We exhibit a finite family of functions over a finite set (i.e. a finite algebra) such that the problem whether a given function can be obtained as a composition of the members of ...
Marcin Kozik