Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

COCO
1994
Springer

favoriteEmaildiscussreport

90views Algorithms» more COCO 1994»

On the Structure of Complete Sets

13 years 9 months ago

On the Structure of Complete Sets

Download blue.utb.edu

We show the following results regarding complete sets.

Harry Buhrman, Leen Torenvliet

Real-time Traffic

Algorithms | COCO 1994 | Complete Sets | NP-complete Sets | Polynomial-time |

claim paper

Related Content

» Complete sets of cooperations

» Observational Coalgebras and Complete Sets of Cooperations

» Strong Reductions and Isomorphism of Complete Sets

» Efficient Calculation of the Complete Optimal Classification Set

» Ordered Completion for FirstOrder Logic Programs on Finite Structures

» Separating Complexity Classes Using Structural Properties

» Lawvere Completion and Separation Via Closure

» Characterlevel Analysis of SemiStructured Documents for Set Expansion

» On the Structure of Bounded Queries to Arbitrary NP Sets

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1994
Where	COCO
Authors	Harry Buhrman, Leen Torenvliet

Comments (0)