Sciweavers

135 search results - page 13 / 27
» Improved dense multivariate polynomial factorization algorit...
Sort
View
ICPP
1996
IEEE
13 years 11 months ago
Polynomial-Time Nested Loop Fusion with Full Parallelism
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
Edwin Hsing-Mean Sha, Chenhua Lang, Nelson L. Pass...
JCSS
2008
96views more  JCSS 2008»
13 years 7 months ago
Precedence constrained scheduling in (2 - 7/(3p+1)) optimal
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...
Devdatta Gangal, Abhiram G. Ranade
CORR
2011
Springer
144views Education» more  CORR 2011»
12 years 11 months ago
Analyzing Walksat on random formulas
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
Amin Coja-Oghlan, Alan M. Frieze
ICCS
2007
Springer
14 years 1 months ago
On the Virtues of Generic Programming for Symbolic Computation
The purpose of this study is to measure the impact of C level code polynomial arithmetic on the performances of AXIOM highlevel algorithms, such as polynomial factorization. More p...
Xin Li, Marc Moreno Maza, Éric Schost
SWAT
2004
Springer
123views Algorithms» more  SWAT 2004»
14 years 26 days ago
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
Michel Habib, Fabien de Montgolfier, Christophe Pa...