## On the complexity of space bounded interactive proofs (1989)

by
Anne Condon

Venue: | In 30th Annual Symposium on Foundations of Computer Science |

Citations: | 55 - 5 self |

### BibTeX

@INPROCEEDINGS{Condon89onthe,

author = {Anne Condon},

title = {On the complexity of space bounded interactive proofs},

booktitle = {In 30th Annual Symposium on Foundations of Computer Science},

year = {1989},

pages = {462--467},

publisher = {IEEE}

}

### OpenURL

### Abstract

Some of the most exciting developments in complexity theory in recent years concern the complexity of interactive proof systems, defined by Goldwasser, Micali and Rackoff (1985) and independently by Babai (1985). In this paper, we survey results on the complexity of space bounded interactive proof systems