1380 search results - page 89 / 276 » A General Polynomial Sieve |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
11 A classical theorem by Ritt states that all the complete decomposition chains of a univariate polynomial satisfying a certain tameness condition have the same length. In this p...
JCT
2007
13 years 10 months ago
2007
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
ORL
1998
13 years 9 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
ADCM
2008
13 years 8 months ago
2008
We derive upper and lower bounds on the dimensions of trivariate spline spaces defined on tetrahedral partitions. The results hold for general partitions, and for all degrees of sm...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP ...