4328 search results - page 285 / 866 » A New Kind of Science |
133
click to vote
STACS
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. We introduce a new class VPSPACE of families of polynomials. Roughly speaking, a family of polynomials is in VPSPACE if its coefficients can be computed in polynomial spa...
160
click to vote
STACS
2007
Springer
16 years 28 days ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
163
click to vote
WG
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. The computation of all minimal transversals of a given hypergraph in output-polynomial time is a long standing open question known as the transversal hypergraph generatio...
171
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
182
click to vote
ACSC
2005
IEEE
16 years 13 days ago
2005
IEEE
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...