Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 206,533,477 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
2-satisfiability
Analysis of algorithms
Approximation-preserving reduction
Asymptotic computational complexity
Expand
Broader (1)
Theoretical computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Python for Scientists and Engineers
K. Millman
,
M. Aivazis
Comput. Sci. Eng.
2011
Corpus ID: 42000294
Python has arguably become the de facto standard for exploratory, interactive, and computation-driven scientific research. This…
Expand
Highly Cited
2005
Highly Cited
2005
Computational Complexity
S. Vadhan
Encyclopedia of Cryptography and Security
2005
Corpus ID: 4056235
Computational complexity theory is the study of the minimal resources needed to solve computational problems. In particular, it…
Expand
Highly Cited
2001
Highly Cited
2001
Theoretical Neuroscience: Computational and Mathematical Modeling of Neural Systems
P. Dayan
,
L. Abbott
2001
Corpus ID: 14072069
Theoretical neuroscience provides a quantitative basis for describing what nervous systems do, determining how they function, and…
Expand
Review
2001
Review
2001
Secure multi-party computation problems and their applications: a review and open problems
Wenliang Du
,
M. Atallah
NSPW '01
2001
Corpus ID: 5505223
The growth of the Internet has triggered tremendous opportunities for cooperative computation, where people are jointly…
Expand
Highly Cited
2000
Highly Cited
2000
Geodesic Active Contours and Level Sets for the Detection and Tracking of Moving Objects
N. Paragios
,
R. Deriche
IEEE Trans. Pattern Anal. Mach. Intell.
2000
Corpus ID: 35342661
This paper presents a new variational framework for detecting and tracking multiple moving objects in image sequences. Motion…
Expand
Highly Cited
1999
Highly Cited
1999
Error Bands for Impulse Responses
C. Sims
,
T. Zha
1999
Corpus ID: 5667933
We examine the theory and behavior in practice of Bayesian and bootstrap methods for generating error bands on impulse responses…
Expand
Highly Cited
1998
Highly Cited
1998
Elements of the Theory of Computation
H. R. Lewis
,
C. Papadimitriou
SIGA
1998
Corpus ID: 12265556
From the Publisher: Lewis and Papadimitriou present this long awaited Second Edition of their best-selling theory of computation…
Expand
Highly Cited
1991
Highly Cited
1991
Partitioning of unstructured problems for parallel processing
H. Simon
1991
Corpus ID: 16197093
Highly Cited
1972
Highly Cited
1972
Reducibility among combinatorial problems" in complexity of computer computations
R. Karp
1972
Corpus ID: 118287333
University of California at Berkeley. Abstract: A large class of computational problems.Since 1999 at UC Berkeley. Computational…
Expand
Highly Cited
1964
Highly Cited
1964
Nonmetric multidimensional scaling: A numerical method
J. Kruskal
1964
Corpus ID: 11709679
We describe the numerical methods required in our approach to multi-dimensional scaling. The rationale of this approach has…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE