Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the complexity of the extreme points decision problem

From MaRDI portal
Publication:1183448
Jump to:navigation, search

DOI10.1016/0020-0190(91)90017-CzbMath0748.68090OpenAlexW2090629766MaRDI QIDQ1183448

Xiao-dong Wang

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90017-c


zbMATH Keywords

lower boundalgebraic-decision-tree


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)




Cites Work

  • Unnamed Item
  • A Lower Bound to Finding Convex Hulls
  • Lower bounds for algebraic decision trees


This page was built for publication: On the complexity of the extreme points decision problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1183448&oldid=12049061"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki