num_pages: 856
description: The proceedings of FOCS'94, sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, and held in November 1994, comprise 70 unrefereed technical papers (many representing reports of continuing research) and three plenary papers. The subjects of the plenary Algorithmic number theory the complexity contribution, by L.M. Adelman; Program result-checking a theory of testing meets a test of theory, by M. Blum and H. Wasserman; and Markov chains and polynomial time algorithms, by R. Kannan. No index. Annotation copyright Book News, Inc. Portland, Or.
language: English
title: IEEE 35th Annual Symposium on Foundations of Computer Science, 1994: November 20-22, 1994 Santa Fe, New Mexico : Proceedings
titlecomplete: IEEE 35th Annual Symposium on Foundations of Computer Science, 1994: November 20-22, 1994 Santa Fe, New Mexico : Proceedings
publisher: IEEE Computer Society