Sciweavers

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

7

CIE
2006
Springer

favoriteEmaildiscussreport

72views Applied Computing» more CIE 2006»

The Jump Classes of Minimal Covers

13 years 8 months ago

The Jump Classes of Minimal Covers

Download www.amsta.leeds.ac.uk

We work in D[< 0 ]. Given the jump class of any (Turing) degree a, the jump classes of the minimal covers of a is a matter which is entirely settled unless a is high2. We show that there exists a c.e. degree which is high2 with no high1 minimal cover.

Andrew E. M. Lewis

Real-time Traffic

Applied Computing | CIE 2006 | Jump Class | Jump Classes | Minimal Cover |

claim paper

Related Content

» Neighbor Systems Jump Systems and Bisubmodular Polyhedra

» Stability Properties of Empirical Risk Minimization over Donsker Classes

» On a New Class of Codes for Identifying Vertices in Graphs

» On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs

» Generalization of land cover maps by mixed integer programming

» The definable multiplicity property and generic automorphisms

» Regularity extraction via clanbased structural circuit decomposition

» Vertex Cover in Graphs with Locally Few Colors

» Using Generalization Error Bounds to Train the Set Covering Machine

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	CIE
Authors	Andrew E. M. Lewis

Comments (0)