Sciweavers

1368 search results - page 44 / 274
» Generalized Rook Polynomials
Sort
View
STOC
1993
ACM
121views Algorithms» more  STOC 1993»
15 years 3 months ago
On the generation of multivariate polynomials which are hard to factor
In this paper we consider the di culty of factoring multivariate polynomials F(x y z :::) modulo n. We consider in particular the case in which F is a product of two randomly chose...
Adi Shamir
ISSAC
1995
Springer
119views Mathematics» more  ISSAC 1995»
15 years 3 months ago
The Singular Value Decomposition for Polynomial Systems
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
Robert M. Corless, Patrizia M. Gianni, Barry M. Tr...
LPAR
2010
Springer
14 years 9 months ago
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...
Friedrich Neurauter, Harald Zankl, Aart Middeldorp
GLVLSI
2003
IEEE
219views VLSI» more  GLVLSI 2003»
15 years 5 months ago
Buffer sizing for minimum energy-delay product by using an approximating polynomial
This paper first presents an accurate and efficient method of estimating the short circuit energy dissipation and the output transition time of CMOS buffers. Next the paper descri...
Chang Woo Kang, Soroush Abbaspour, Massoud Pedram
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 4 days ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy