11016 search results - page 690 / 2204 » Cloud Computing for Science |
197
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
197
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
146
Voted
STACS
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. We consider the problem of representing, in a compressed format, a bitvector S of m bits with n 1s, supporting the following operations, where b ∈ {0, 1}:
182
Voted
STACS
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...
161
Voted
STACS
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...