Article View: comp.theory
Article #1890Re: Probabilistic Turing Machines
From: Klaus Gaarder FNI
Date: Wed, 06 Jan 1993 14:14
Date: Wed, 06 Jan 1993 14:14
46 lines
1631 bytes
1631 bytes
Consult the paper
"Computational Complexity of Probabilistic Turing Machines" by John GILL,
SIAM J of Computing, vol 6, no 4, 1977.
THere are also numerous papers on the subject (or related to it) in the
cryptographic litterature on Zero-Knowledge Interactive Proof systems, documented
in eg Springer LNCS proceedings from CRYPTO and EUROCRYPT confs, and the ACM STOC
and FOCS proceedings of later years. Key authors are
S. Goldwasser
S. Micali
C. Rackoff
O. Goldreich
A. Widgerson
G. Brassard
C. Crepeau
often in collaboration.
Klaus
*-------------------------------*
| Klaus Gaarder, cand. scient. |
| Research Scientist |
| Norwegian Telecom Research |
| Po Box 83, N-2007 Kjeller |
| Norway. |
| Tel: +476 809871 |
| Fax: +476 810076 |
*-------------------------------*
--
__o
_`\<,_
(*)/ (*) Claudio Caputti
+++++++++++++++++++++++++++++++++++++++^++++++++++++++++++++++++++++++++++++++
Free will - the result of chaotic amplification of quantum events in the brain.
------------------------------------------------------------------------------
Technical Details
Message-ID:
<1993Jan6.141449.6860@nntp.nta.no>Path:
arc1-ca.pugleaf.net!sparky!uunet!usc!rpi!think.com!enterpoop.mit.edu!eru.mt.luth.se!lunic!sunic!aun.uninett.no!nuug!nntp.nta.no!hal.nta.no!klausReferences:
<1993Jan5.191925.27528@infodev.cam.ac.uk>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!usc!rpi!think.com!enterpoop.mit.edu!eru.mt.luth.se!lunic!sunic!aun.uninett.no!nuug!nntp.nta.no!hal.nta.no!klaus From: klaus@hal.nta.no (Klaus Gaarder FNI) Newsgroups: comp.theory Subject: Re: Probabilistic Turing Machines Message-ID: <1993Jan6.141449.6860@nntp.nta.no> Date: 6 Jan 93 14:14:49 GMT References: <1993Jan5.191925.27528@infodev.cam.ac.uk> Sender: news@nntp.nta.no Organization: Norwegian Telecom Research Lines: 46 Nntp-Posting-Host: periferix.nta.no