Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,729,628 papers from all fields of science
Search
Sign In
Create Free Account
Function problem
Known as:
Function problems
, Self-reducible
In computational complexity theory, a function problem is a computational problem where a single output (of a total function) is expected for every…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
34 relations
Boolean satisfiability problem
Complexity class
Computability
Computable function
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
The response of common building construction technologies to the urban poor and their environment
B. Wekesa
,
G. Steyn
,
F. Otieno
2010
Corpus ID: 58907502
Highly Cited
2008
Highly Cited
2008
On calibration and validation of eigendeformation-based multiscale models for failure analysis of heterogeneous systems
Caglar Oskay
,
Jacob Fish
2008
Corpus ID: 264236521
We present a new strategy for calibration and validation of hierarchical multiscale models based on computational homogenization…
Expand
2004
2004
On the reducibility of sets inside NP to sets with low information content
Mitsunori Ogihara
,
Till Tantau
Journal of computer and system sciences (Print)
2004
Corpus ID: 11030898
1998
1998
Metal ion reconstitution studies of yeast copper-zinc superoxide dismutase: the "phantom" subunit and the possible role of Lys7p
T. Lyons
,
A. Nersissian
,
J. J. Goto
,
Haining Zhu
,
E. B. Gralla
,
J. Valentine
JBIC Journal of Biological Inorganic Chemistry
1998
Corpus ID: 20404918
Abstract Using a corrected molar extinction coefficient for yeast apo copper-zinc superoxide dismutase (CuZnSOD), we have…
Expand
1994
1994
E-Complete Sets Do Not Have Optimal Polynomial Time Approximations
P. Duris
,
J. Rolim
International Symposium on Mathematical…
1994
Corpus ID: 30679853
The p-levelability of intractable sets that are, for example, honestly paddable, or monotone self-reducible in certain restricted…
Expand
1991
1991
Languages that are easier than their proofs
R. Beigel
,
M. Bellare
,
J. Feigenbaum
,
S. Goldwasser
[] Proceedings 32nd Annual Symposium of…
1991
Corpus ID: 15149232
Languages in NP are presented for which it is harder to prove membership interactively than it is to decide this membership…
Expand
1990
1990
Bi-Immunity Results for Cheatable Sets
R. Beigel
Theoretical Computer Science
1990
Corpus ID: 17515256
1988
1988
Natural Self-Reducible Sets
A. Selman
SIAM journal on computing (Print)
1988
Corpus ID: 38806645
To every set A in NP we associate a (collection of) natural self-reducible set${\operatorname{set}}(s)$. We prove that every…
Expand
1986
1986
Optimal Approximations of Complete Sets
David A. Russo
Symposium on Computation Theory
1986
Corpus ID: 19911428
Orponen, Russo, and Sch6ning [0RS85] investigated the notion of polynomially levelable sets and showed that many "natural…
Expand
1986
1986
Optimal Approximations and Polynomially Levelable Sets
P. Orponen
,
David A. Russo
,
U. Schöning
SIAM journal on computing (Print)
1986
Corpus ID: 5441808
A set A not in P is polynomially levelable if any algorithm for A has speedup to a polynomial infinitely often in A: precisely…
Expand
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