2430 search results - page 45 / 486 » Computing Tutte Polynomials |
FOCS
1996
IEEE
15 years 6 months ago
1996
IEEE
119
click to vote
DCC
2008
IEEE
16 years 2 months ago
2008
IEEE
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
104
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
116
click to vote
FSTTCS
2003
Springer
15 years 7 months ago
2003
Springer
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. The...
125
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...