✦ LIBER ✦

Upper bounds on ideals in the computably enumerable Turing degrees

✍ Scribed by George Barmpalias; André Nies

Book ID: 108054689
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 267 KB
Volume: 162
Category: Article
ISSN: 0168-0072
DOI: 10.1016/j.apal.2010.12.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposability of low 2-computably enum

Decomposability of low 2-computably enumerable degrees and turing jumps in the Ershov hierarchy

✍ M. Kh. Faizrakhmanov 📂 Article 📅 2010 🏛 Allerton Press, Inc. 🌐 English ⚖ 538 KB

Bounding computably enumerable degrees i

Bounding computably enumerable degrees in the Ershov hierarchy

✍ Angsheng Li; Guohua Wu; Yue Yang 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 219 KB

A Note On the Turing Degrees of Divergen

A Note On the Turing Degrees of Divergence Bounded Computable Reals

✍ Xizhong Zheng; Robert Rettinger 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 198 KB

An upper bound on the sum of squares of

An upper bound on the sum of squares of degrees in a graph

✍ D. de Caen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 163 KB

Let G be a simple graph with n vertices, e edges and vertex degrees &, d2 ..... d~. It is proved that d2+ ... +d~<~e(2e/(n-1)+ n-2) when n~>2. This bound does not generalize to all sequences of positive integers. A comparison is made to another upper bound on d 2 +. • -+ d 2, due to Sz6kely et al. (

Lower bounds on the stability number of

Lower bounds on the stability number of graphs computed in terms of degrees

✍ Owen Murphy 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 246 KB

An upper bound on the independence numbe

An upper bound on the independence number of a graph computable in polynomial-time

✍ Carlos J. Luz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 450 KB