Sciweavers

1284 search results - page 15 / 257
» On Helping and Interactive Proof Systems
Sort
View
ENTCS
2000
60views more  ENTCS 2000»
13 years 7 months ago
Writing Constructive Proofs Yielding Efficient Extracted Programs
The NuPRL system [3] was designed for interactive writing of machine
Aleksey Nogin
CIA
2006
Springer
13 years 11 months ago
The Helpful Environment: Distributed Agents and Services Which Cooperate
Imagine a future environment where networks of agents - people, robots and software agents - interact with sophisticated sensor grids and environmental actuators to provide advice,...
Austin Tate
IUI
2003
ACM
14 years 22 days ago
Personal choice point: helping users visualize what it means to buy a BMW
How do we know if we can afford a particular purchase? We can find out what the payments might be and check our balances on various accounts, but does this answer the question? Wh...
Andrew E. Fano, Scott W. Kurth
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
14 years 7 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
24
Voted
LPAR
2001
Springer
13 years 12 months ago
A Computer Environment for Writing Ordinary Mathematical Proofs
The EPGY Theorem-Proving Environment is designed to help students write ordinary mathematical proofs. The system, used in a selection of computer-based proof-intensive mathematics ...
David McMath, Marianna Rozenfeld, Richard Sommer