Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

34 relations
Boolean satisfiability problemComplexity classComputabilityComputable function

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Identification and Prediction Using Neuro-Fuzzy Networks with Symbiotic Adaptive Particle Swarm Optimization
Identification and Prediction Using Neuro-Fuzzy Networks with Symbiotic Adaptive Particle Swarm Optimization 
2010
2010
The response of common building construction technologies to the urban poor and their environment
2004
2004
On the reducibility of sets inside NP to sets with low information content
1998
1998
Metal ion reconstitution studies of yeast copper-zinc superoxide dismutase: the "phantom" subunit and the possible role of Lys7p
Abstract Using a corrected molar extinction coefficient for yeast apo copper-zinc superoxide dismutase (CuZnSOD), we have… 
1996
1996
Upper bounds for the complexity of sparse and tally descriptions
We investigate the complexity of computing small descriptions for sets in various reduction classes to sparse sets. For example… 
1991
1991
Languages that are easier than their proofs
Languages in NP are presented for which it is harder to prove membership interactively than it is to decide this membership… 
1991
1991
Any Language in IP Has a Divertable ZKIP
A notion of “divertible” zero-knowledge interactive proof systems was introduced by Okamoto and Ohta, and they showed that for… 
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… 
1986
1986
Optimal Approximations and Polynomially Levelable Sets
A set A not in P is polynomially levelable if any algorithm for A has speedup to a polynomial infinitely often in A: precisely… 
1986
1986
Optimal Approximations of Complete Sets
Orponen, Russo, and Sch6ning [0RS85] investigated the notion of polynomially levelable sets and showed that many "natural… 
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)