Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,252,481 papers from all fields of science
Search
Sign In
Create Free Account
Constructible function
Known as:
Time-constructible function
, Space constructible
, Space-constructible
Expand
In complexity theory, a time-constructible function is a function f from natural numbers to natural numbers with the property that f(n) can be…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Computational complexity theory
Euler calculus
Gap theorem
Space hierarchy theorem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Algebraic representations and constructible sheaves
G. Williamson
2016
Corpus ID: 119165031
I survey what is known about simple modules for reductive algebraic groups. The emphasis is on characteristic p > 0 and Lusztig’s…
Expand
2010
2010
Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
Eli Ben-Sasson
,
Swastik Kopparty
,
J. Radhakrishnan
IEEE Transactions on Information Theory
2010
Corpus ID: 206737833
We show combinatorial limitations on efficient list decoding of Reed-Solomon codes beyond the Johnson-Guraswami-Sudan bounds. In…
Expand
Highly Cited
2010
Highly Cited
2010
A Systematic Framework for the Construction of Optimal Complete Complementary Codes
Chenggao Han
,
N. Suehiro
,
T. Hashimoto
IEEE Transactions on Information Theory
2010
Corpus ID: 1842838
The complete complementary code (CCC) that was proposed by Suehiro and Hatori is a sequence family, that is a set of sequence…
Expand
Highly Cited
2005
Highly Cited
2005
Turing computations on ordinals
P. Koepke
Bulletin of Symbolic Logic
2005
Corpus ID: 918786
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to…
Expand
2000
2000
Space-Efficient Reversible Simulations
Ryan Williams
2000
Corpus ID: 2324965
We study constructions that convert arbitrary deterministic Turing machines to reversible machines; i.e. reversible simulations…
Expand
1995
1995
On the comparison theorem for étale cohomology of non-Archimedean analytic spaces
V. Berkovich
1995
Corpus ID: 18893525
Let ϕ:Y →X be a morphism of finite type between schemes of locally finite type over a non-Archimedean fieldk, and letF be an…
Expand
1994
1994
as an initial segment of the c-degrees
M. Groszek
Journal of Symbolic Logic (JSL)
1994
Corpus ID: 41581303
Abstract By an “inverse iteration” of Sacks forcing over a model of V = L, we produce a model in which the degrees of…
Expand
1990
1990
Vanishing in highest degree for solutions of D -modules and perverse sheaves
P. Schapira
1990
Corpus ID: 54518664
Let M be a real analytic manifold of dimension w, X a complexificati on of M, Ji a coherent module over the sheaf of rings &x of…
Expand
Highly Cited
1985
Highly Cited
1985
Index theorem for constructible sheaves
M. Kashiwara
1985
Corpus ID: 116429727
The invention comprises compounds of the isomeric formulae: or where R1 is C5-8 cycloalkyl, R2 is hydrogen, bromine, chlorine…
Expand
1967
1967
A nonconstructible Δ₃¹ set of integers
R. Solovay
1967
Corpus ID: 121572115
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required