Author： Kaltofen E. Lee W.-s.
Publisher： Elsevier
ISSN： 0747-7171
Source： Journal of Symbolic Computation, Vol.36, Iss.3, 2003-09, pp. : 365-400
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A family of optimal termination detection algorithms
By Mittal Neeraj Venkatesan S. Peri Sathya
Distributed Computing, Vol. 20, Iss. 2, 2007-08 ,pp. :
Access to resources
Recommend
Improving Parallel Ordering of Sparse Matrices Using Genetic Algorithms
By Lin Wen-Yang
Applied Intelligence, Vol. 23, Iss. 3, 2005-12 ,pp. :
Hybrid ant colony algorithms for path planning in sparse graphs
By Lim Kwee
Soft Computing, Vol. 12, Iss. 10, 2008-08 ,pp. :
Rank inequalities and separation algorithms for packing designs and sparse triple systems
By Moura L.
Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. :