Using PVS to validate the algorithms of an exact arithmetic

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.291, Iss.2, 2003-01, pp. : 203-218

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings

By Björklund Andreas Husfeldt Thore

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 226-249

Springer Publishing Company

Access to resources Recommend Favorite

Exact and heuristic methodologies for scheduling in hospitals: problems, formulations and algorithms

By Beliën Jeroen

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 5, Iss. 2, 2007-07 ,pp. : 157-160

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions

By Dorn Frederic Penninkx Eelko Bodlaender Hans Fomin Fedor

Algorithmica, Vol. 58, Iss. 3, 2010-11 ,pp. : 790-810

Springer Publishing Company

Access to resources Recommend Favorite

Exact Algorithms for L(2,1)-Labeling of Graphs

By Havet Frédéric Klazar Martin Kratochvíl Jan Kratsch Dieter Liedloff Mathieu

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 169-194

Springer Publishing Company

Access to resources Recommend Favorite

On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms

By Fomin Fedor Gaspers Serge Pyatkin Artem Razgon Igor

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 293-307

Springer Publishing Company

Access to resources Recommend Favorite