Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,390,371 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.
2016
2016
Notes on the characteristic cycle of a constructible sheaf
Takeshi Saito
2016
Corpus ID: 55757704
We study some properties of the characteristic cycle of a constructible complex on a smooth variety over a perfect field, push…
Expand
2016
2016
A note on stable recollements
C. Barwick
,
Saul Glasman
2016
Corpus ID: 37338086
In this short \'etude, we observe that the full structure of a recollement on a stable infinity-category can be reconstructed…
Expand
2014
2014
Characteristic cycle and the Euler number of a constructible sheaf on a surface
Takeshi Saito
2014
Corpus ID: 55502628
We define the characteristic cycle of a constructible sheaf on a smooth surface in the cotangent bundle. We prove that the…
Expand
2008
2008
Springer theory via the Hitchin fibration
D. Nadler
Compositio Mathematica
2008
Corpus ID: 17128183
Abstract We develop the Springer theory of Weyl group representations in the language of symplectic topology. Given a semisimple…
Expand
2005
2005
Representing Paraconsistent Reasoning via Quantified Propositional Logic
P. Besnard
,
Torsten Schaub
,
H. Tompits
,
S. Woltran
Inconsistency Tolerance
2005
Corpus ID: 366122
Quantified propositional logic is an extension of classical propositional logic where quantifications over atomic formulas are…
Expand
2004
2004
A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation
A. Avellone
,
Camillo Fiorentini
,
G. Fiorino
,
U. Moscato
Annual Conference for Computer Science Logic
2004
Corpus ID: 470499
A tableau calculus for a logic with constructive negation and an implementation of the related decision procedure is presented…
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
2000
2000
Regularity of the Brunovsky-Kronecker Stratification
Josep Ferrer-Llop
,
M. I. García-Planas
,
F. Puerta
SIAM Journal on Matrix Analysis and Applications
2000
Corpus ID: 11211972
We study the partition of the set of pairs of matrices according to the Brunovsky--Kronecker type. We show that it is a…
Expand
1994
1994
Polynomial-time construction of codes II. Spherical codes and the kissing number of spheres
G. Lachaud
,
J. Stern
IEEE Transactions on Information Theory
1994
Corpus ID: 27889306
A spherical code is a finite set X of points lying on the unit sphere of R/sup n/. For such a set, we define /spl rho/(X) as the…
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