Skip to search formSkip to main contentSkip to account menu

Constructible function

Known as: Time-constructible function, Space constructible, Space-constructible 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
I survey what is known about simple modules for reductive algebraic groups. The emphasis is on characteristic p > 0 and Lusztig’s… 
2010
2010
We show combinatorial limitations on efficient list decoding of Reed-Solomon codes beyond the Johnson-Guraswami-Sudan bounds. In… 
Highly Cited
2010
Highly Cited
2010
The complete complementary code (CCC) that was proposed by Suehiro and Hatori is a sequence family, that is a set of sequence… 
Highly Cited
2005
Highly Cited
2005
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to… 
2000
2000
We study constructions that convert arbitrary deterministic Turing machines to reversible machines; i.e. reversible simulations… 
1995
1995
Let ϕ:Y →X be a morphism of finite type between schemes of locally finite type over a non-Archimedean fieldk, and letF be an… 
1994
1994
Abstract By an “inverse iteration” of Sacks forcing over a model of V = L, we produce a model in which the degrees of… 
1990
1990
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… 
Highly Cited
1985
Highly Cited
1985
The invention comprises compounds of the isomeric formulae: or where R1 is C5-8 cycloalkyl, R2 is hydrogen, bromine, chlorine…