Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2007
Highly Cited
2007
Accurate Computational Fluid Dynamics (CFD) simulations of atmospheric boundary layer (ABL) flow are essential for a wide variety… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2007
Highly Cited
2007
Abstract.Impagliazzo and Wigderson (1998) gave the first construction of pseudorandom generators from a uniform complexity… Expand
Highly Cited
2001
Highly Cited
2001
The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some… Expand
  • table I
Highly Cited
1992
Highly Cited
1992
This paper presents a three-move interactive identification scheme and proves it to be as secure as the discrete logarithm… Expand
Highly Cited
1991
Highly Cited
1991
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f… Expand
Highly Cited
1989
Highly Cited
1989
The paper studies effective approximate solutions to combinatorial counting and uniform generation problems. Using a technique… Expand
Highly Cited
1987
Highly Cited
1987
  • M. Tompa, H. Woll
  • 28th Annual Symposium on Foundations of Computer…
  • 1987
  • Corpus ID: 14500783
The notion of a zero knowledge interactive proof that one party "knows" some secret information is explored. It is shown that any… Expand
Highly Cited
1986
Highly Cited
1986
Abstract The class of problems involving the random generation of combinatorial structures from a uniform distribution is… Expand
  • figure 3
  • figure 5
Highly Cited
1982
Highly Cited
1982
  • A. Selman
  • Theor. Comput. Sci.
  • 1982
  • Corpus ID: 205091158
Abstract P-selective sets are used to distinguish polynomial time-bounded reducibilities on NP. In particular, we consider… Expand
  • figure 1