13603 search results - page 365 / 2721 » On the Computational Complexity of Cut-Reduction |
185
click to vote
ISSAC
2005
Springer
16 years 1 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
211
click to vote
FOCS
2002
IEEE
16 years 15 days ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
214
click to vote
WACV
2002
IEEE
16 years 14 days ago
2002
IEEE
3D models of urban sites with geometry and facade textures are needed for many planning and visualization applications. Approximate 3D wireframe model can be derived from aerial i...
177
click to vote
IPPS
2000
IEEE
15 years 12 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
214
click to vote
JMLR
2010
15 years 2 months ago
2010
Maximum likelihood estimators are often of limited practical use due to the intensive computation they require. We propose a family of alternative estimators that maximize a stoch...