STACS
2010
Springer
13 years 11 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP do...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neigh...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We show that the Tile Assembly Model exhibits a strong notion of universality where the goal is to give a single tile assembly system that simulates the behavior of any other tile...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Using ε-bias spaces over F2, we show that the Remote Point Problem (RPP), introduced by Alon et al [APY09], has an NC2 algorithm (achieving the same parameters as [APY09]). We stu...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic sem...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Currently there are many service providers on the Web. Industry recognizes that from Web services many different business applications can be quickly created. A Web servi...