Sciweavers

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

11

MLQ
2000

favoriteEmaildiscussreport

51views more MLQ 2000»

There is No Low Maximal D.C.E. Degree

13 years 7 months ago

There is No Low Maximal D.C.E. Degree

Download www.amsta.leeds.ac.uk

We give a corrected proof of an extension of the Robinson Splitting Theorem for the d.c.e. degrees. The purpose of this short paper is to clarify and correct the main result and proof contained in [1]. There we gave a simple proof that there exists no low maximal d.c.e. degree. This was obtained as an immediate corollary of the following strengthening of the Robinson Splitting

Marat M. Arslanov, S. Barry Cooper, Angsheng Li

Real-time Traffic

Corrected Proof | MLQ 2000 | Robinson Splitting | Robinson Splitting Theorem |

claim paper

Related Content

» Atlanta World An Expectation Maximization Framework for Simultaneous LowLevel Edge Groupin...

» LowComplexity Distributed Scheduling Algorithms for Wireless Networks

» A Novel Flow Control Scheme for Best Effort Traffic in NoC Based on Source Rate Utility Ma...

» Maximizing Spare Utilization by Virtually Reorganizing Faulty Cache Lines

» The Power of Orientation in SymmetryBreaking

» Semantic Precision and Recall for Ontology Alignment Evaluation

» Multiscale PhotonLimited Spectral Image Reconstruction

» Groupaware Stream Filtering

» Fully Distributed Active and Passive Task Management for Grid Computing

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	MLQ
Authors	Marat M. Arslanov, S. Barry Cooper, Angsheng Li

Comments (0)