2430 search results - page 19 / 486 » Computing Tutte Polynomials |
116
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
106
click to vote
ISSAC
2004
Springer
15 years 7 months ago
2004
Springer
Let L be an algebraic function field in k ≥ 0 parameters t1, . . . , tk. Let f1, f2 be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first,...
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— We construct a family of iterative discretization algorithms for computing sequences of finitely-supported correlated equilibria of n-player games with polynomial utility func...
113
click to vote
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
130
Voted
ISAAC
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...