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.
2016
2016
In this presentation I will describe a testing and monitoring landscape with reference to four premises that I think are key: a… 
2015
2015
We will use the transfer function technique to solve the plane rotator with nearest neighbour interactions and a magnetic field… 
2015
2015
For solving traveling salesman problem (TSP), the ant colony optimization (ACO) algorithm and simulated annealing (SA) algorithm… 
2014
2014
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 
2001
2001
Longprt, L. and A.L. Selman, Hard promise problems and nonuniform complexity, Theoretical Computer Science 115 (1993) 277-290… 
1995
1995
Let LT/sub 1/ denote the class of languages accepted by nonuniform families of polynomial size depth-1 circuits with a linear… 
Review
1989
Review
1989
We survey several results related to non- uniform complexity classes and their comparison with uni- form ones. The relevance of… 
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…