理学 计算复杂性 释 interactive proof 交互式证明 交互式证明（Interactive Proof）是包含了非确定性（nondeterminism）、随机性（randomness）、交互性（interaction）的一种计算模型。一个交互式证明系统由证明器（Prover）和验证器（Verifier）组成。证明器的计算能力无限（非确定性），验证器的计算能力有限但可以利用随机数（随机性），证明器和验证器之间交替地发送消息（交互性）。
理论计算机科学 可计算性与计算复杂性 释文 interactive proofs 交互式证明
- many-one correspondence
- many-one degree
- many one reducibility
- many-one reducibility
- many-one reducible set
- many-one reducible to
- many-particle system
- many-person game
- many photon process
- many-photon process
- many-placed operation
- many-placed predicate
- manyseeded euptelea
- many-sheeted surface
- many-sorted algebra
- many-sorted language
- many-sorted logical calculus
- many sorted predicate calculus
- many-sorted predicate calculus
- many-stage
- many-to-many function
- many-to-many mapping
- many-to-one
- many-to-one correspondence
- many-to-one function