Circuit complexity and functionality: A statistical thermodynamics perspective
Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem. Recently, in the context of black holes, circuit complexit...
Saved in:
| Published in: | Proceedings of the National Academy of Sciences - PNAS Vol. 122; no. 23; p. e2415913122 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
United States
10.06.2025
|
| Subjects: | |
| ISSN: | 1091-6490, 1091-6490 |
| Online Access: | Get more information |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!