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… (More)
Wikipedia

Related topics

Related topics

34 relations
Boolean satisfiability problemComplexity classComputabilityComputable function
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A New Wavelet Threshold Function and Denoising Application
In order to improve the effects of denoising, this paper introduces the basic principles of wavelet threshold denoising and… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Subcubic Equivalences between Path, Matrix and Triangle Problems
We say an algorithm on n by n matrices with entries in [-M, M] (or n-node graphs with edge weights from [-M, M]) is truly sub… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
CFD simulation of the atmospheric boundary layer - wall function problems
Accurate Computational Fluid Dynamics (CFD) simulations of atmospheric boundary layer (ABL) flow are essential for a wide variety… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
ALGEBRAIC AND GEOMETRIC APPROACH IN FUNCTION PROBLEM SOLVING
This study explores students’ algebraic and geometric approach in solving tasks in functions and the relation of these approaches… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2003
2003
Function problems for Quantified Boolean Formulas
The practical use of Quantified Boolean Formulas (QBFs) often calls for more than solving the evaluation problem QBF. For this… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Neutrality and the Evolvability of Boolean Function Landscape
This work is a study of neutrality in the context of Evolutionary Computation systems. In particular, we introduce the use of… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
1998
1998
The Moving Target Function Problem in Multi-Agent Learning
We describea framework that canbeusedto modeland predict thebehaviorof MASswith learningagents. It uses a differenceequationfor… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… (More)
Is this relevant?
1991
1991
Self-reducible sets of small density
We study the complexity of sets that are at the same time self-reducible and sparse orm-reducible to sparse sets. We show that… (More)
  • figure 1
  • table 1
Is this relevant?
1985
1985
Light-harvesting II (B800-B850 complex) structural genes from Rhodopseudomonas capsulata.
The light-harvesting II (LHII) structural genes coding for the (B800-B850 complex) beta- and alpha-polypeptides have been cloned… (More)
Is this relevant?