理学 计算复杂性 释 interactive proof 交互式证明 交互式证明（Interactive Proof）是包含了非确定性（nondeterminism）、随机性（randomness）、交互性（interaction）的一种计算模型。一个交互式证明系统由证明器（Prover）和验证器（Verifier）组成。证明器的计算能力无限（非确定性），验证器的计算能力有限但可以利用随机数（随机性），证明器和验证器之间交替地发送消息（交互性）。
理论计算机科学 可计算性与计算复杂性 释文 interactive proofs 交互式证明
- Theoretical Works Series of Chinese Classical Zaju and Qu
- theoretic simulation
- the organization and procedure of comprehensive planning
- The Organization of Intermediate Records Storage
- Theorie des modernen Dramas
- Theories and Practice of Modern Landscape Architecture in the Western World
- theories for social work
- theories of archival appraisal
- theories of archival open access
- theories of archival resources construction
- theories of attachment
- Theories of Bootstrapping
- theories of color vision
- theories of connection
- theories of hearing
- theories of human nature in organizational behavior
- theories of imperialism
- theories of journalism
- theories of mass communication
- theories of mass culture
- theories of mountainous human settlement
- theories of programs
- theories of rational planning
- theories of social work
- theories of sport training