理论计算机科学 可计算性与计算复杂性 释文 interactive polynomial time equals polynomial space problem, IP=PSPACE problem 交互式多项式时间等于多项式空间问题
- strong multiplicity-one theorem
- strong negation
- strong norm
- strong normalizability theorem
- strong nuclear interaction
- strong operator topology
- strong-operator topology
- strong oriented graph
- strong partial order
- strong perfect graph theorem
- strong permanent magnets
- strong pinning
- strong preference relation
- strong product
- strong property
- strong pseudoconvex
- strong pseudoprime
- strong pseudoprime test
- strong recursive presentation
- strong red
- strong reflection
- strong reflection principle
- strong regular graph
- strong relation
- strong relative minimum