32 search results - page 4 / 7 » Newton's method and the Computational Complexity of the Fund... |
STACS
2010
Springer
14 years 18 days ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
AISC
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Origami (paper folding) has a long tradition in Japan's culture and education. We are developing a computational origami system, based on symbolic computation system...
LSSC
2007
Springer
14 years 1 months ago
2007
Springer
Model reduction of large-scale linear time-invariant systems is an ubiquitous task in control and simulation of complex dynamical processes. We discuss how LQG balanced truncation ...
JACM
2000
13 years 7 months ago
2000
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...