{"id":"https://openalex.org/keywords/ac0-circuits","display_name":"AC0 circuits","description":"AC0 circuits are constant-depth Boolean circuits of polynomial size with unbounded-fan-in AND and OR gates, studied in computational complexity.","display_name_alternatives":["AC^0 circuits","AC_0 circuits","AC0 circuit","AC^0 circuit"],"ids":{"openalex":"https://openalex.org/keywords/ac0-circuits","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6988,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6988,"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"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.0751,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":247,"cited_by_count":4473,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/ac0-circuits","updated_date":"2026-11-19T04:05:57","created_date":"2026-09-30T00:00:00"}
