Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 240,857,310 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
34 relations
Boolean satisfiability problem
Complexity class
Computability
Computable function
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Visual Functions in Parkinson’s Disease
Mosaad Alhassan
2018
Corpus ID: 149725071
2015
2015
Transfer function approaches to the one-dimensional thermodynamics of classical magnets, and the long-range dipole interaction in rare-earth pyrochlores
R. Mason
2015
Corpus ID: 115480898
We will use the transfer function technique to solve the plane rotator with nearest neighbour interactions and a magnetic field…
Expand
2014
2014
IMPACT AND OPTIMAL CONTROL OF MOVEMENT ON A MULTIPATCH HEPATITIS C VIRUS MODEL
Okosun Kazeem Oare
2014
Corpus ID: 15998606
In this paper, a deterministic multipatch hepatitis C virus model is considered and analyzed. Investigated also is the existence…
Expand
2011
2011
Identification and Prediction Using Neuro-Fuzzy Networks with Symbiotic Adaptive Particle Swarm Optimization
Cheng-Jian Lin
,
Chun-Cheng Peng
,
Chi-Yung Lee
Informatica
2011
Corpus ID: 41110663
Identification and Prediction Using Neuro-Fuzzy Networks with Symbiotic Adaptive Particle Swarm Optimization
2004
2004
Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility
A. Pavan
,
N. V. Vinodchandran
Electron. Colloquium Comput. Complex.
2004
Corpus ID: 14052170
We consider Arthur-Merlin proof systems where (a) Arthur is a probabilistic quasi-polynomial time Turing machine, denoted AMqpoly…
Expand
2004
2004
A few methods of the performance test of network link
Qiu Wang
2004
Corpus ID: 58488408
Current many schools,transact the place all a concept for setting up local area net work,realizes resources sharing,better…
Expand
2003
2003
Function problems for Quantified Boolean Formulas
S. Coste-Marquis
,
H. Fargier
,
J. Lang
,
Daniel Le Berre
,
P. Marquis
2003
Corpus ID: 3165223
The practical use of Quantified Boolean Formulas (QBFs) often calls for more than solving the evaluation problem QBF . For this…
Expand
2001
2001
Hard promise problems and nonuniform complexity
Luc Longprtt
2001
Corpus ID: 29611683
Longprt, L. and A.L. Selman, Hard promise problems and nonuniform complexity, Theoretical Computer Science 115 (1993) 277-290…
Expand
1994
1994
Modulo Classes and Advice
J. Ramachandran
1994
Corpus ID: 16303406
We prove an upper bound on computing advice for a language A in the class of languages acceptable in deterministic polynomial…
Expand
Review
1989
Review
1989
Nondeterministic Witnesses and Nonuniform Advice
L. Balcbar
1989
Corpus ID: 54089590
We survey several results related to non- uniform complexity classes and their comparison with uni- form ones. The relevance of…
Expand