BibTeX Export for A lower bound for the complexity of linear optimization from a quantifier-elimination point of view

Copy to Clipboard Download

@InProceedings{grimson:DagSemProc.07212.3,
  author =	{Grimson, Rafael},
  title =	{{A lower bound for the complexity of linear optimization from a quantifier-elimination point of view}},
  booktitle =	{Constraint Databases, Geometric Elimination and Geographic Information Systems},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7212},
  editor =	{Bernd Bank and Max J. Egenhofer and Bart Kuijpers},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07212.3},
  URN =		{urn:nbn:de:0030-drops-12837},
  doi =		{10.4230/DagSemProc.07212.3},
  annote =	{Keywords: Quantifier elimination, dense representation, instrinsic, lower bound}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode