2430 search results - page 171 / 486 » Computing Tutte Polynomials |
126
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
150
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
164
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
Detecting low-level image features such as edges and ridges with spatial filters is improved if the scale of the features are known a priori. Scale-space representations and wavele...
112
click to vote
ARITH
2007
IEEE
15 years 11 months ago
2007
IEEE
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
100
click to vote
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...