Popular Searches
Definitions
Efficient
polynomial-time
approximation
scheme
Nearby Words

Efficient polynomial-time approximation scheme

Polynomial-time
See Polynomial time
Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)
This article is licensed under the GNU Free Documentation License.
Last updated on Thursday April 28, 2005 at 17:04:38 PDT (GMT -0700)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Related Articles
Findings from University of Haifa in Algorithms Reported.
Feb 28, 2012; "We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of n items must...
Read more with a free trial on HighBeam.com »
University of Durham Details Research in Computer Science.
Apr 05, 2011; "A t-spanner of a graph G is its spanning subgraph S such that the distance between every pair of vertices in S is at most t...
Read more with a free trial on HighBeam.com »
HighBeam Research, Inc. © Copyright 2009.

Search another word or see Efficient polynomial-time approximation schemeon Dictionary | Thesaurus |Spanish
  • Please Login or Sign Up to use the Recent Searches feature
FAVORITES
RECENT