{"id":"https://openalex.org/keywords/big-o-notation","display_name":"big O notation","description":"Big O notation describes an upper bound on the asymptotic growth of a function, commonly used to analyze algorithms and computational complexity.","display_name_alternatives":["big O","O notation","big-oh notation","Bachmann\u2013Landau notation","Landau notation"],"ids":{"openalex":"https://openalex.org/keywords/big-o-notation","wikidata":"https://www.wikidata.org/wiki/Q269878"},"primary_topic":null,"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.1733,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10533","display_name":"Teaching and Learning Programming","score":0.1458,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1424,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":387,"cited_by_count":1859,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/big-o-notation","updated_date":"2026-11-20T04:06:44","created_date":"2022-04-12T19:38:12"}
