Concept information
TERME PRÉFÉRENTIEL
computational complexity
DÉFINITION(S)
- theory used to classify different computational problems according to the difficulty of solving them. This theory is at the heart of computer science: in computer science, it is not enough to show that a solution to a given problem exists; it must be possible to construct it using "reasonable" computing resources (time and memory space). (Source: translated from https://ia.gdria.fr/Glossaire/complexite/ )
CONCEPT(S) GÉNÉRIQUE(S)
TRADUCTIONS
-
français
URI
http://data.loterre.fr/ark:/67375/23L-CTFH12H7-8
{{toUpperCase label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}