理学 计算复杂性 释 circuit complexity 电路复杂性 电路复杂性（circuit complexity）是计算复杂性的研究方向之一。电路（circuit）是与图灵机不同的一种计算模型。电路由门（gate）和导线（wire）组成，门与门之间通过导线连接。电路的规模（size）是电路的门数或导线数，电路的深度（depth）是从输入到输出的最长路径的长度。电路复杂性通常是指电路的规模或深度。一个计算问题的电路复杂性是计算此问题的电路的最小规模或深度。电路复杂性的下界证明是难度很大、富有挑战性的研究方向。
理论计算机科学 可计算性与计算复杂性 释文 circuit complexity 线路复杂性
- National Animal Disease Center
- National Animal Quarantine Institute, Ministry of Agriculture of the People's Republic of China
- National Anthem
- national anthem
- National Aquatics Center
- National Aquatics Center (Water Cube)
- National Archaeological Museum of Athens
- National Archives and Records Administration
- National Archives and Records Centre Act of Singapore
- National Archives and Records Service of South Africa
- National Archives of Australia
- National Archives of Brazil / Arquivo Nacional
- National Archives of Finland
- National Archives of India
- National Archives of Japan
- National Archives of Korea
- National Archives of Malaysia
- National Archives of Pakistan
- National Archives of Russian Federation
- National Archives of Singapore
- national archives of Spain
- National Archives of Sweden
- National Archives of the United States
- National Archives Science and Technology Research Institute
- national archives secret