Computational complexity
Amount of resources to perform an algorithm
📊 Rating
1 news mentions · 👍 0 likes · 👎 0 dislikes
📌 Topics
- Artificial Intelligence (1)
- Computational Theory (1)
- Formal Methods (1)
🏷️ Keywords
POMDP (1) · Reachability Value (1) · Markov Decision Processes (1) · Computational Complexity (1) · Robotics (1) · Algorithm Design (1) · arXiv (1)
📖 Key Information
In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem.
📰 Related News (1)
-
🇺🇸 Computing the Reachability Value of Posterior-Deterministic POMDPs
arXiv:2602.07473v1 Announce Type: new Abstract: Partially observable Markov decision processes (POMDPs) are a fundamental model for sequential decisi...
🔗 Entity Intersection Graph
People and organizations frequently mentioned alongside Computational complexity:
- 🌐 Robotics (1 shared articles)
- 🌐 Partially observable Markov decision process (1 shared articles)
- 🌐 Markov decision process (1 shared articles)