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

Computational problem

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
We present an overview of supersingular isogeny cryptography and how it fits into the broad theme of post-quantum public-key… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2011
Highly Cited
2011
  • Salil P. Vadhan
  • Encyclopedia of Cryptography and Security
  • 2011
  • Corpus ID: 4056235
Computational complexity theory is the study of the minimal resources needed to solve computational problems. In particular, it… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Simulation games are now increasingly applied to many subject domains as they allow students to engage in discovery processes… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Theoretical neuroscience provides a quantitative basis for describing what nervous systems do, determining how they function, and… Expand
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… Expand
  • 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… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
From the Publisher: Lewis and Papadimitriou present this long awaited Second Edition of their best-selling theory of computation… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Once we have developed an algorithm (q.v.) for solving a computational problem and analyzed its worst-case time requirements as a… Expand
Is this relevant?
Highly Cited
1972
Highly Cited
1972
University of California at Berkeley. Abstract: A large class of computational problems.Since 1999 at UC Berkeley. Computational… Expand
Is this relevant?