28888 search results - page 429 / 5778 » Computability and complexity in analysis |
230
click to vote
AB
2008
Springer
16 years 1 months ago
2008
Springer
A specific class of ODEs has been shown to be adequate to describe the essential features of the complex dynamics of Gene-Regulatory Networks (GRN). But, the effective exploitatio...
180
click to vote
STACS
2010
Springer
16 years 1 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...
167
click to vote
WG
2007
Springer
16 years 29 days ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
171
click to vote
FCT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...
173
click to vote
FCT
2001
Springer
15 years 11 months ago
2001
Springer
We show that some natural refinements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar refinements of the polynom...