Skip to search formSkip to main contentSkip to account menu

Low basis theorem

Known as: Basis theorem 
The low basis theorem in computability theory states that every nonempty class in (see arithmetical hierarchy) contains a set of low degree (Soare… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Highly Cited
2004
Highly Cited
2004
Highly Cited
2000
Highly Cited
2000
In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI) whose optimal solution can be… 
Highly Cited
1999
Highly Cited
1999
O INTRODUCTION 1. Fundamental Problem of Algebra 2. Fundamental Problem of Classical Algebraic Geometry 3. Fundamental Problem of… 
1997
1997
The (semi)standard Young tableau have been known since Hodge and Littlewood to naturally index a basis for the multihomogeneous… 
Highly Cited
1995
Highly Cited
1995
Introduction.- Elementary Definitions.- I Basic Constructions.- II Dimension Theory.- III Homological Methods.- Appendices… 
Review
1989
Review
1989
Highly Cited
1988
Highly Cited
1988
In [5] and [21] we studied countable algebra in the context of “reverse mathematics”. We considered set existence axioms… 
1978
1978
Without recourse to the normal basis theorem, some (mk, k) cyclic codes are put into quasi-cyclic form, and their weight… 
1968
1968
ƒ = k[xi9 • • • , #» , %n+i, • • • » #iv] = £[-X"i, • • • , XivJ/O, where Q = (gi, • • • , q8) is a, finitely generated ideal…