Combinatorial methods in Boolean function complexity /

Saved in:

Bibliographic Details
Author / Creator:	Gál, A. (Anna)
Imprint:	1995.
Description:	vi, 73 leaves ; 28 cm.
Language:	English
Subject:	Computational complexity. Fault-tolerant computing. Algebra, Boolean. Algebra, Boolean. Computational complexity. Fault-tolerant computing.
Format:	Dissertations Print Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/2344998

Hidden Bibliographic Details
Notes:	Thesis (Ph. D.)--University of Chicago, Dept. of Computer Science, August 1995. Includes bibliographical references.

Mansueto

Holdings details from Mansueto
Call Number:	QA999 Gal
c.1	Available Loan period: standard loan Request from Mansueto Scan and Deliver Need help? - Ask a Librarian