1092 search results - page 55 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
167
Voted
CORR
2012
Springer
14 years 1 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
202
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
169
click to vote
CHES
2005
Springer
15 years 11 months ago
2005
Springer
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
158
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
149
click to vote
DATE
2007
IEEE
16 years 4 days ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...