Sciweavers

1380 search results - page 44 / 276
» A General Polynomial Sieve
Sort
View
JSC
2008
162views more  JSC 2008»
13 years 8 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...
JCT
2010
112views more  JCT 2010»
13 years 7 months ago
More on block intersection polynomials and new applications to graphs and block designs
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
Leonard H. Soicher
TLCA
2007
Springer
14 years 2 months ago
Polynomial Size Analysis of First-Order Functions
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
Olha Shkaravska, Ron van Kesteren, Marko C. J. D. ...
ICRA
2003
IEEE
128views Robotics» more  ICRA 2003»
14 years 2 months ago
Avoiding unsafe states in manufacturing systems based on polynomial digraph algorithms
Abstract − A deadlock-free unsafe (DFU) state of Resource Allocation System (RAS) is deadlock-free but inevitable to enter a deadlock state. Previous research revealed that in ma...
Yin Wang, Zhiming Wu
STOC
1993
ACM
121views Algorithms» more  STOC 1993»
14 years 23 days 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