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.
2018
2018
Visual Functions in Parkinson’s Disease
2016
2016
Listing Presenting Author : Cameron Sinclair Organization : BINDT Country : UK Paper Title : How to Improve Safety , Reliability and Growth : A Personal UK View of the Testing and Monitoring…
In this presentation I will describe a testing and monitoring landscape with reference to four premises that I think are key: a… 
2015
2015
Transfer function approaches to the one-dimensional thermodynamics of classical magnets, and the long-range dipole interaction in rare-earth pyrochlores
We will use the transfer function technique to solve the plane rotator with nearest neighbour interactions and a magnetic field… 
2014
2014
IMPACT AND OPTIMAL CONTROL OF MOVEMENT ON A MULTIPATCH HEPATITIS C VIRUS MODEL
In this paper, a deterministic multipatch hepatitis C virus model is considered and analyzed. Investigated also is the existence… 
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 
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… 
2001
2001
Hard promise problems and nonuniform complexity
Longprt, L. and A.L. Selman, Hard promise problems and nonuniform complexity, Theoretical Computer Science 115 (1993) 277-290… 
Review
1989
Review
1989
Nondeterministic Witnesses and Nonuniform Advice
We survey several results related to non- uniform complexity classes and their comparison with uni- form ones. The relevance of… 
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… 
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)