Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/7969
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGRIMSON, Rafael-
dc.date.accessioned2008-03-13T10:53:20Z-
dc.date.available2008-03-13T10:53:20Z-
dc.date.issued2007-
dc.identifier.citationBANK, Bernd & EGENHOFER, Max & KUIJPERS, Bart (Ed.) Dagstuhl Seminar Proceedings 07212: Constraint Databases, Geometric Elimination and Geographic Information Systems.-
dc.identifier.issn1862-4405-
dc.identifier.urihttp://hdl.handle.net/1942/7969-
dc.description.abstractWe analyze the arithmetic complexity of the feasibility problem in linear optimization theory as a quantifier-elimination problem. For the case of polyhedra defined by 2n halfspaces in R^n we prove that, if dense representation is used to code polynomials, any quantifier-free formula expressing the set of parameters describing nonempty polyhedra has size Ω(4n ).-
dc.language.isoen-
dc.publisherDagstuhl-
dc.titleA lower bound for the complexity of linear optimization from a quantifier-elimination point of view-
dc.typeProceedings Paper-
local.bibliographicCitation.authorsBANK, Bernd-
local.bibliographicCitation.authorsEGENHOFER, Max-
local.bibliographicCitation.authorsKUIJPERS, Bart-
local.bibliographicCitation.conferencedate20-25 May 2007-
local.bibliographicCitation.conferencenameDagstuhl Seminar Proceedings 07212: Constraint Databases, Geometric Elimination and Geographic Information Systems-
local.bibliographicCitation.conferenceplaceDagstuhl-
local.bibliographicCitation.jcatC1-
local.type.specifiedProceedings Paper-
dc.bibliographicCitation.oldjcatC2-
dc.identifier.urlhttp://drops.dagstuhl.de/opus/volltexte/2007/1283/pdf/07212.GrimsonRafael.ExtAbstract.1283.pdf-
local.bibliographicCitation.btitleDagstuhl Seminar Proceedings 07212: Constraint Databases, Geometric Elimination and Geographic Information Systems-
item.accessRightsOpen Access-
item.fullcitationGRIMSON, Rafael (2007) A lower bound for the complexity of linear optimization from a quantifier-elimination point of view. In: BANK, Bernd & EGENHOFER, Max & KUIJPERS, Bart (Ed.) Dagstuhl Seminar Proceedings 07212: Constraint Databases, Geometric Elimination and Geographic Information Systems..-
item.contributorGRIMSON, Rafael-
item.fulltextWith Fulltext-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
07212.GrimsonRafael.ExtAbstract.1283.pdf168.31 kBAdobe PDFView/Open
Show simple item record

Page view(s)

36
checked on Nov 7, 2023

Download(s)

8
checked on Nov 7, 2023

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.