Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/7969
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | GRIMSON, Rafael | - |
dc.date.accessioned | 2008-03-13T10:53:20Z | - |
dc.date.available | 2008-03-13T10:53:20Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | BANK, Bernd & EGENHOFER, Max & KUIJPERS, Bart (Ed.) Dagstuhl Seminar Proceedings 07212: Constraint Databases, Geometric Elimination and Geographic Information Systems. | - |
dc.identifier.issn | 1862-4405 | - |
dc.identifier.uri | http://hdl.handle.net/1942/7969 | - |
dc.description.abstract | We 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.iso | en | - |
dc.publisher | Dagstuhl | - |
dc.title | A lower bound for the complexity of linear optimization from a quantifier-elimination point of view | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | BANK, Bernd | - |
local.bibliographicCitation.authors | EGENHOFER, Max | - |
local.bibliographicCitation.authors | KUIJPERS, Bart | - |
local.bibliographicCitation.conferencedate | 20-25 May 2007 | - |
local.bibliographicCitation.conferencename | Dagstuhl Seminar Proceedings 07212: Constraint Databases, Geometric Elimination and Geographic Information Systems | - |
local.bibliographicCitation.conferenceplace | Dagstuhl | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.specified | Proceedings Paper | - |
dc.bibliographicCitation.oldjcat | C2 | - |
dc.identifier.url | http://drops.dagstuhl.de/opus/volltexte/2007/1283/pdf/07212.GrimsonRafael.ExtAbstract.1283.pdf | - |
local.bibliographicCitation.btitle | Dagstuhl Seminar Proceedings 07212: Constraint Databases, Geometric Elimination and Geographic Information Systems | - |
item.accessRights | Open Access | - |
item.fullcitation | GRIMSON, 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.contributor | GRIMSON, Rafael | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
07212.GrimsonRafael.ExtAbstract.1283.pdf | 168.31 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.