Computational complexity of logical problems
Subtitle: formulas, dependencies, and circuits
By: by Lawrence Alan Denenberg
Published: 1984
Language: eng
Format: microform :
Number of pages: 111
Subjects: Symbolic and mathematical Logic; Computational complexity
Notes: Thesis (Ph. D.)--Harvard University, 1984.

Bibliography: leaves 107-110.