Sciweavers

1650 search results - page 181 / 330
» The HOM problem is decidable
Sort
View
MP
2008
94views more  MP 2008»
15 years 4 months ago
The complexity of recognizing linear systems with certain integrality properties
Let A be a 0 - 1 matrix with precisely two 1's in each column and let 1 be the all-one vector. We show that the problems of deciding whether the linear system Ax 1, x 0 (1)...
Guoli Ding, Li Feng, Wenan Zang
FUIN
2007
86views more  FUIN 2007»
15 years 4 months ago
Relative Nondeterministic Information Logic is EXPTIME-complete
We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIME-complete. Such ...
Stéphane Demri, Ewa Orlowska
SIAMCOMP
2008
86views more  SIAMCOMP 2008»
15 years 4 months ago
The Complexity of Monadic Second-Order Unification
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
ADT
2005
15 years 4 months ago
Assembling components with behavioural contracts
Component based design is a new paradigm to build distributed systems and applications. The problem of compositional verification of such systems is however still open. We investig...
Cyril Carrez, Alessandro Fantechi, Elie Najm
APPML
2005
55views more  APPML 2005»
15 years 4 months ago
Recovering a phylogenetic tree using pairwise closure operations
A fundamental task in evolutionary biology is the amalgamation of a collection P of leaf-labelled trees into a single parent tree. A desirable feature of any such amalgamation is ...
Katharina T. Huber, Vincent Moulton, Charles Sempl...