complexiteitsgraad
Sign in to saveAlso known as computational complexity class
set of problems in computational complexity theory of related resource-based complexity
In the Vinony graph
Vinony's link graph records 246 inbound references to complexiteitsgraad, and connects out to randomized algorithm, Arthur–Merlin protocol and Turing machine.
It is catalogued under topics including Complexity classes, Computational complexity theory and Measures of complexity.
Vinony links it to 25 Wikipedia language editions.
Article · Nederlands
De complexiteitsgraad van een bepaald algoritme is de manier waarop dat algoritme zich gedraagt als de grootte van het op te lossen probleem toeneemt.
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
randomized algorithm
Entity
Arthur–Merlin protocol
Entity
Turing machine
Entity
computational complexity theory
Entity
NP-complete
Entity
time complexity
Entity
primality test
Entity
NP-hard
Entity
PSPACE
Entity
RP
Entity
♯P
Entity
polynomial-time reduction
Entity
interactive proof system
Entity
Monte Carlo algorithm
Entity
RL
Entity
computer
Entity
economics
Entity
linguistics
Entity
International Standard Book Number
Entity
algorithm
Entity