Sciweavers

STACS
2010
Springer
14 years 7 months ago
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Maurice Jansen
STACS
2010
Springer
14 years 7 months ago
Inseparability and Strong Hypotheses for Disjoint NP Pairs
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...
Lance Fortnow, Jack H. Lutz, Elvira Mayordomo
STACS
2010
Springer
14 years 7 months ago
Treewidth Reduction for Constrained Separation and Bipartization Problems
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...
Dániel Marx, Barry O'Sullivan, Igor Razgon
STACS
2010
Springer
14 years 7 months ago
Revisiting the Rice Theorem of Cellular Automata
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...
Pierre Guillon, Gaétan Richard
STACS
2010
Springer
14 years 7 months ago
Intrinsic Universality in Self-Assembly
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...
David Doty, Jack H. Lutz, Matthew J. Patitz, Scott...
STACS
2010
Springer
14 years 7 months ago
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets
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...
Vikraman Arvind, Srikanth Srinivasan
STACS
2010
Springer
14 years 7 months ago
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
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...
Bireswar Das, Jacobo Torán, Fabian Wagner
STACS
2010
Springer
14 years 7 months ago
Named Models in Coalgebraic Hybrid Logic
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...
Lutz Schröder, Dirk Pattinson
STACS
2010
Springer
14 years 7 months ago
Finding Induced Subgraphs via Minimal Triangulations
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...
Fedor V. Fomin, Yngve Villanger
SOFSEM
2009
Springer
14 years 9 months ago
A Formal Model of Business Application Integration from Web Services (Position Paper)
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...
Kaiyu Wan, Mubarak Mohammad, Vasu S. Alagar