About: Big-O Notation     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Class, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
rdfs:label
  • Big-O Notation
rdfs:subClassOf
Semantic_Type
  • Conceptual Entity
Preferred_Name
  • Big-O Notation
UMLS_CUI
  • C1706938
Legacy_Concept_Name
  • Big-O_Notation
FULL_SYN
  • Big-O NotationPTNCI
DEFINITION
  • A theoretical measure of the execution of an algorithm, usually the time or memory needed, given the problem size n, which is usually the number of items; a mathematical notation used to describe the asymptotic behavior of functions. More precisely, it is used to describe an asymptotic upper bound for the magnitude of a function in terms of another, usually simpler, function. (from NIST)NCI
code
  • C52089
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 114 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software