Upper and lower bounds
flowchart AA["Associated Authors (0)"] C[Upper and lower bounds] BC["Broader Concepts (1)"] NC["Narrower Concepts (6)"] C== skos:broader ==>BC NC== skos:broader ==>C AA== dcterms:relation ==>C click BC "#broader-concepts" click NC "#narrower-concepts" click AA "#associated-authors" NI["add incoming edge"] NO["add outgoing edge"] NI-- ? -->C C-- ? -->NO click NI "#add-incoming-edge" click NO "#add-outgoing-edge" style NI stroke-width:2px,stroke-dasharray: 5 5 style NO stroke-width:2px,stroke-dasharray: 5 5
- Wikidata
- https://www.wikidata.org/wiki/Q13222579
- OpenAlex ID
- https://openalex.org/C77553402 (API record)
- OpenAlex Description
- every element of a partially ordered set A which is greater (resp. lower) than every element of a subset B included in A
- OpenAlex Level [?]
- 2
Broader Concepts
Narrower Concepts
- Competitive analysis
- Cramér–Rao bound
- Exponential time hypothesis
- Limit analysis
- Log-log plot
- Streaming algorithm
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.