理学 计算复杂性 释 interactive proof 交互式证明 交互式证明（Interactive Proof）是包含了非确定性（nondeterminism）、随机性（randomness）、交互性（interaction）的一种计算模型。一个交互式证明系统由证明器（Prover）和验证器（Verifier）组成。证明器的计算能力无限（非确定性），验证器的计算能力有限但可以利用随机数（随机性），证明器和验证器之间交替地发送消息（交互性）。
理论计算机科学 可计算性与计算复杂性 释文 interactive proofs 交互式证明
- Collection of Fantasy Stories by a Native of Sanshui
- Collection of Fantasy Tales
- Collection of Feng Guanglu
- Collection of Feng Xiaoqing
- Collection of Five Pinghua Storites
- Collection of Folk Children’s Songs
- Collection of Folk Songs
- Collection of Folksongs in China
- Collection of Folk Songs in Southwestern Region
- collection of formulas
- Collection of Gao Changshi
- collection of government
- Collection of Gu Huayang
- Collection of Haifushantang
- Collection of Hai Zhongjie
- Collection of Han Chunquan’s Treatises on Landscape Painting
- Collection of Historical Archives
- Collection of Historical Data of the Ming Dynasty (1368-1644)
- Collection of Historical Documents Concern in Emigration of Chinese Laborers
- Collection of Huangfu Sixun
- Collection of Huangshan
- Collection of Huang Zhangpu
- collection of illustrative plates
- Collection of Imperial Edicts of Northern Song Dynasty
- collection of imperial orders