Computational problem

Known as: Computation problem, Computational problems 
In theoretical computer science, a computational problem is a mathematical object representing a collection of questions that computers might be able… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1951-2018
010020019512017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
We give deterministic ~O(2<sup>2n+o(n)</sup>)-time algorithms to solve all the most important computational problems on point… (More)
Is this relevant?
2008
2008
In 2001, Bellare, Namprempre, Pointcheval and Semanko introduced the notion of “one-more” computational problems. Since their… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The small sample size problem is often encountered in pattern recognition. It results in the singularity of the within-class… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class… (More)
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The general secure multi-party computation problem is when multiple parties (say, Alice and Bob) each have private data… (More)
  • figure 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to… (More)
Is this relevant?
1995
1995
We examine phase transitions in problems derived from real computational problems using a wide variety of algorithms. These phase… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Many large scale computational problems are based on unstruc-tured computational domains. Primary examples are unstructured grid… (More)
  • table 2
  • table 3
  • table 4
  • table 5
  • table 7
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We introduce a rigorous performance criterion for training algorithms for probabilistic automata (PAs) and hidden Markov models… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
This book is an introduction, on the undergraduate level, to the classical and contemporary theor y of computation . The topics… (More)
Is this relevant?