787 search results - page 9 / 158 » Polynomial Constants are Decidable |
GD
2004
Springer
14 years 1 months ago
2004
Springer
We prove that the number of distinct weaving patterns produced by n semi-algebraic curves in R3 defined coordinate-wise by polynomials of degrees bounded by some constant d, is b...
STACS
2009
Springer
14 years 14 days ago
2009
Springer
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
CRYPTO
2001
Springer
14 years 13 days ago
2001
Springer
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
ICLP
1999
Springer
14 years 6 days ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
TCOM
2008
13 years 7 months ago
2008
The step size leading to the absolute minimum of the constant modulus (CM) criterion along the search direction can be obtained algebraically at each iteration among the roots of a...