Was (wer) ist computational complexity - definition
Computational complexity
MEASURE OF THE AMOUNT OF RESOURCES NEEDED TO RUN AN ALGORITHM OR SOLVE A COMPUTATIONAL PROBLEM
Asymptotic complexity; Computational Complexity; Bit complexity; Context of computational complexity; Complexity of computation (bit); Computational complexities
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.
computational complexity
MEASURE OF THE AMOUNT OF RESOURCES NEEDED TO RUN AN ALGORITHM OR SOLVE A COMPUTATIONAL PROBLEM
Asymptotic complexity; Computational Complexity; Bit complexity; Context of computational complexity; Complexity of computation (bit); Computational complexities
<algorithm> The number of steps or arithmetic operations
required to solve a computational problem. One of the three
kinds of complexity.
(1996-04-24)
Computational Complexity Conference
ACADEMIC CONFERENCE IN THEORETICAL COMPUTER SCIENCE
User:Sevag.gharibian/sandbox/Computational Complexity Conference; Conference on Computational Complexity; CCC (conference)
The Computational Complexity Conference (CCC), is an academic conference in the field of theoretical computer science whose roots date to 1986. It fosters research in computational complexity theory, and is typically held annually between mid-May and mid-July in North America or Europe.
