Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,736,110 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
7 relations
Arithmetical hierarchy
König's lemma
Low (computability)
PA degree
Expand
Broader (1)
Computability theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Demuth randomness and computational complexity
A. Kucera
,
A. Nies
Ann. Pure Appl. Log.
2011
Corpus ID: 7749234
Highly Cited
2004
Highly Cited
2004
Computing polynomial program invariants
M. Müller-Olm
,
H. Seidl
Inf. Process. Lett.
2004
Corpus ID: 15706942
Highly Cited
2000
Highly Cited
2000
Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
P. Parrilo
2000
Corpus ID: 122626142
In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI) whose optimal solution can be…
Expand
Highly Cited
1999
Highly Cited
1999
Fundamental problems of algorithmic algebra
C. Yap
1999
Corpus ID: 5211139
O INTRODUCTION 1. Fundamental Problem of Algebra 2. Fundamental Problem of Classical Algebraic Geometry 3. Fundamental Problem of…
Expand
1997
1997
Generalized straightening laws for products of determinants
B. D. Taylor
1997
Corpus ID: 118110370
The (semi)standard Young tableau have been known since Hodge and Littlewood to naturally index a basis for the multihomogeneous…
Expand
Highly Cited
1995
Highly Cited
1995
Commutative Algebra: with a View Toward Algebraic Geometry
D. Eisenbud
1995
Corpus ID: 116911954
Introduction.- Elementary Definitions.- I Basic Constructions.- II Dimension Theory.- III Homological Methods.- Appendices…
Expand
Review
1989
Review
1989
Grobner Bases and Invariant Theory
B. Sturmfels
,
N. White
1989
Corpus ID: 121997707
Highly Cited
1988
Highly Cited
1988
Ordinal numbers and the Hilbert basis theorem
S. G. Simpson
Journal of Symbolic Logic
1988
Corpus ID: 19467645
In [5] and [21] we studied countable algebra in the context of “reverse mathematics”. We considered set existence axioms…
Expand
1978
1978
Some (ink, k) cyclic codes in quasi-cyclic form (Corresp.)
V. Bhargava
,
G. Séguin
,
J. Stein
IEEE Trans. Inf. Theory
1978
Corpus ID: 33221131
Without recourse to the normal basis theorem, some (mk, k) cyclic codes are put into quasi-cyclic form, and their weight…
Expand
1968
1968
Constructive normalization of an algebraic variety
G. Stolzenberg
1968
Corpus ID: 122899876
ƒ = k[xi9 • • • , #» , %n+i, • • • » #iv] = £[-X"i, • • • , XivJ/O, where Q = (gi, • • • , q8) is a, finitely generated ideal…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE