×

Found 5 Documents (Results 1–5)

On interactive proofs with a laconic prover (extended abstract). (English) Zbl 0986.68533

Orejas, Fernando (ed.) et al., Automata, languages and programming. 28th international colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2076, 334-345 (2001).
MSC:  68T15 03F20 91A80 68Q15
PDFBibTeX XMLCite
Full Text: Link

On the limits of non-approximability of lattice problems. (English) Zbl 1011.68512

STOC ’98. Proceedings of the 30th annual ACM symposium on theory of computing, Dallas, TX, USA, May 23-26, 1998. New York, NY: ACM, Association for Computing Machinery. 1-9 (1998).
MSC:  68T15
PDFBibTeX XMLCite

A taxonomy of proof systems. (English) Zbl 0880.68116

Hemaspaandra, Lane A. (ed.) et al., Complexity theory retrospective II. Proceedings of the 10th annual IEEE conference on Structure in complexity theory. Minneapolis, MN, USA. June 19-22, 1995. New York, NY: Springer. 109-134 (1997).
MSC:  68T15
PDFBibTeX XMLCite

Filter Results by …

Document Type

Year of Publication

Main Field

Software