<--- Back to Details
First PageDocument Content
Algebra / Mathematics / Polynomials / Abstract algebra / Computer algebra / Polynomial / Factorization of polynomials / Constraint programming / Resultant / Constraint logic programming / Polynomial ring
Date: 2014-06-27 12:47:14
Algebra
Mathematics
Polynomials
Abstract algebra
Computer algebra
Polynomial
Factorization of polynomials
Constraint programming
Resultant
Constraint logic programming
Polynomial ring

Solving Non-Linear Arithmetic Dejan Jovanovi´c1 and Leonardo de Moura2 1 2 New York University

Add to Reading List

Source URL: csl.sri.com

Download Document from Source Website

File Size: 867,59 KB

Share Document on Facebook

Similar Documents

Fast polynomial factorization, modular composition, and multipoint evaluation of multivariate polynomials in small characteristic Christopher Umans∗ Computer Science Department California Institute of Technology

Fast polynomial factorization, modular composition, and multipoint evaluation of multivariate polynomials in small characteristic Christopher Umans∗ Computer Science Department California Institute of Technology

DocID: 1rDyf - View Document

A Characterization of Semisimple Plane Polynomial Automorphisms. Jean-Philippe FURTER, Dpt. of Math., Univ. of La Rochelle, av. M. Crépeau, La Rochelle, FRANCE email:

A Characterization of Semisimple Plane Polynomial Automorphisms. Jean-Philippe FURTER, Dpt. of Math., Univ. of La Rochelle, av. M. Crépeau, La Rochelle, FRANCE email:

DocID: 1raZ0 - View Document

New Algorithms for Learning in Presence of Errors∗ Sanjeev Arora  Rong Ge

New Algorithms for Learning in Presence of Errors∗ Sanjeev Arora Rong Ge

DocID: 1r7T9 - View Document

Primary decomposition of zero-dimensional ideals: Putting Monico’s algorithm into practice extended abstract †

Primary decomposition of zero-dimensional ideals: Putting Monico’s algorithm into practice extended abstract †

DocID: 1r2Hp - View Document

doi:j.jnt

doi:j.jnt

DocID: 1qIei - View Document