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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
We present a new strategy for calibration and validation of hierarchical multiscale models based on computational homogenization… 
2004
2004
1998
1998
Abstract Using a corrected molar extinction coefficient for yeast apo copper-zinc superoxide dismutase (CuZnSOD), we have… 
1994
1994
The p-levelability of intractable sets that are, for example, honestly paddable, or monotone self-reducible in certain restricted… 
1991
1991
Languages in NP are presented for which it is harder to prove membership interactively than it is to decide this membership… 
1988
1988
  • A. Selman
  • 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
Orponen, Russo, and Sch6ning [0RS85] investigated the notion of polynomially levelable sets and showed that many "natural… 
1986
1986
A set A not in P is polynomially levelable if any algorithm for A has speedup to a polynomial infinitely often in A: precisely…