z-logo
open-access-imgOpen Access
Polynomials over the reals are safe for program interpretations
Author(s) -
Guillaume Bonfante,
Florian Deloup,
Antoine Henrot
Publication year - 2009
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - p , interpretation (philosophy) , pspace , computational complexity theory , field (mathematics) , computer science , mathematics , abstract interpretation , algebra over a field , time complexity , discrete mathematics , theoretical computer science , algorithm , pure mathematics , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here