Live briefing
Everything about Computational problem
Problem a computer might be able to solve
In theoretical computer science, a problem is one that asks for a solution in terms of an algorithm. For example, the problem of factoring"Given a positive integer n, find a nontrivial prime factor of n." Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Computational problemA 5-minute orientation
- Skim a recent paper: Competitive programming in computational thinking and problem solving educationInfluential work since 2022
- Pick up a classic book: Reconfigurable Processor Array A Bit Sliced Parallel Computer (USA)The most-reprinted book on the subject
- Read the landmark paper: Computational aspects of the maximum diversity problemCited 132 times
- Go sideways: Function problemA closely related topic
- Go sideways: Decision problemA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Computational aspects of the maximum diversity problem
Computational protein design as an optimization problem
The optimal network problem: Some computational procedures
Problem-solving Environments For Computational Science
Computational Structure of the N-Body Problem
Computational gene identification: an open problem
A computational inverse diffraction grating problem
Computational complexity of the quantum separability problem
🆕 Influential since 2022
Competitive programming in computational thinking and problem solving education
On the computational complexity of the secure state-reconstruction problem
Addressing antibiotic resistance: computational answers to a biological problem?
Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation
Multicellular artificial neural network-type architectures demonstrate computational problem solving
📚 Books worth reading
Reconfigurable Processor Array A Bit Sliced Parallel Computer (USA)A. Rushton · 1986
Software EngineeringRoger S. Pressman, Bruce Maxim · 1982
Artificial intelligenceStuart J. Russell, Peter Norvig · 1994
C++ how to programHarvey M. Deitel, Paul J. Deitel · 1992
Computer ConceptsJune Jamrich Parsons, Dan Oja · 1996
Advances in Swarm IntelligenceYing Tan · 2012
BTEC National for IT PractitionersSharon Yull · 2008
Parallel Processing and Applied MathematicsRoman Wyrzykowski · 2003
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Function problem In computational complexity theory, a function problem is a computational problem where a single output is expected for every input, but the output is…
- Decision problem In computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question on a…
- Computational complexity theory In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource…
- Complexity class In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly…
- NP (complexity) Unsolved problem in computer science 𝖯 =? 𝖭𝖯 More unsolved problems in computer science In computational complexity theory, NP (nondeterministic polynomial…
- Optimization problem In mathematics, engineering, computer science and economics, an optimization problem is the problem of finding the best solution from all feasible solutions…
- Co-NP In computational complexity theory, co-NP is a complexity class. A decision problem X is a member of co-NP if and only if its complement X is in the complexity…
- RE (complexity) In computability theory and computational complexity theory, RE (recursively enumerable) is the class of decision problems for which a 'yes' answer can…