理学 计算复杂性 释 counting complexity 计数复杂性 计数复杂性指计数问题的算法易解性和计算困难性（见计算复杂性）。
理论计算机科学 可计算性与计算复杂性 释文 counting complexity 计数复杂性
- algorithmic logic
- algorithmic number theory
- algorithmic operator
- algorithmic problem
- algorithmic randomness theory
- algorithmic recognition
- algorithmic reducibility
- algorithmics
- algorithmic set theory
- algorithmic solvability
- algorithmic theory
- algorithmic theory of sets
- algorithmic trading platform
- algorithmic undecidability
- algorithmic unsolvability
- algorithm implementation
- algorithmization
- algorithm library
- algorithm lower bound analysis
- algorithm of absorbing Markov chain
- algorithm of bootstrap resampling
- algorithm of division
- algorithm of EM
- algorithm of expectation maximization
- algorithm of expectation-maximization