8196 search results - page 73 / 1640 » Computational Modeling and Complexity Science |
WG
2007
Springer
15 years 3 months 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...
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
We show1 that non-deterministic time NTIME(n) is not contained in deterministic time n 2and polylogarithmic space, for any > 0. This implies that (infinitely often) satisfiabi...
FOCS
1997
IEEE
15 years 2 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
MFCS
1990
Springer
15 years 1 months ago
1990
Springer
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
EUROCOLT
1999
Springer
15 years 2 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...