Elias' Article

Quantifier elimination for small degree polyomials.
Chrysida Galanaki and Elias P. Tsigaridas.
In 7th Panhellenic Logic Symposium (PLS), Patras, Greece, 2009.

• Home
• Research
• Teaching
• Contact

Files:

[PDF] 187.7kB  [gzipped postscript] 78.1kB  

Abstract:

We present a special purpose quantifier elimination algorithm, which can eliminate the quantifier $\exists x$, in the formula $(\exists x \in \RR)[ p (x) \wedge g]$, where $p(x)$ is a polynomial of degree $łeq 4$, and $g$ is a polynomial inequality.

@InProceedings{gt-pls-2009,
  author =       {Chrysida Galanaki and Elias~P. Tsigaridas},
  title =        {Quantifier elimination for small degree polyomials},
  booktitle =    "7th Panhellenic Logic Symposium (PLS)",
  year =         2009,
  address =      {Patras, Greece},
  abstract =     " We present a special purpose quantifier elimination
                  algorithm, which can eliminate the quantifier
                  $\exists x$, in the formula $(\exists x \in \RR)[ p
                  (x) \wedge g]$, where $p(x)$ is a polynomial of
                  degree $\leq 4$, and $g$ is a polynomial
                  inequality.",
  abstract =     " We present a special purpose quantifier elimination
                  algorithm, which can eliminate the quantifier
                  $\exists x$, in the formula $(\exists x \in \RR)[ p
                  (x) \wedge g]$, where $p(x)$ is a polynomial of
                  degree $\leq 4$, and $g$ is a polynomial
                  inequality.",
}

Generated by bib2html.pl (written by Patrick Riley , modified by Elias ) on Wed Oct 23, 2019 21:41:02