2430 search results - page 128 / 486 » Computing Tutte Polynomials |
144
Voted
DAGSTUHL
2007
15 years 6 months ago
2007
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
124
Voted
DAGSTUHL
2006
15 years 6 months ago
2006
Given a set of monomials, the Minimum AND-Circuit problem asks for a circuit that computes these monomials using AND-gates of fan-in two and being of minimum size. We prove that t...
146
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within in time exponential in a polynomial in the size of the gam...
126
click to vote
ENTCS
2006
15 years 5 months ago
2006
We are concerned with programs composed of cooperative threads whose execution proceeds in synchronous rounds called instants. We develop static analysis methods to guarantee that...
113
click to vote
ENTCS
2002
15 years 4 months ago
2002
If S = 0 is a system of n equations and unknowns over C and S() = 0 to what extent can we compute with the point ? In particular, can we decide whether or not a polynomial express...