理学 计算复杂性 释 counting complexity 计数复杂性 计数复杂性指计数问题的算法易解性和计算困难性（见计算复杂性）。
理论计算机科学 可计算性与计算复杂性 释文 counting complexity 计数复杂性
- Gottfried Achenwall
- Gottfried Semper
- Gottfried Silbermann
- Gottfried von Einem
- Gottfried Wilhelm Leibniz
- Gotthard Base Tunnel
- Gotthold Ephraim Lessing
- Gottingen State and University Library
- Gottlieb Daimler
- Gottlob Frege
- Gottschalk
- Gouache
- Goubangzi Jiedao
- Goudiao
- Goudsmit
- Gougunao tea
- gou gu theorem
- gou gu xian theorem
- Goulan (an open-air performance venue)
- Goulan Washe
- Goulburn
- Gould
- Gould belt
- Gould Hsu inversion
- Gould-Hsu inversion