283 search results - page 7 / 57 » Deterministic Polynomial Time Algorithms for Matrix Completi... |
177
click to vote
TCS
2011
14 years 11 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
134
click to vote
COCO
2008
Springer
15 years 6 months ago
2008
Springer
This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP, two queries to a SAT oracle is equivalent to one query. That is, ZPPSAT[1] = ZPPSAT [2] = ...
133
click to vote
CAI
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
122
click to vote
IJCGA
2006
15 years 4 months ago
2006
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
167
click to vote
ESA
1999
Springer
15 years 8 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...