Parity, circuits, and the polynomial-time hierarchy

Saved in:
Bibliographic Details
Published in22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) pp. 260 - 270
Main Authors Furst, Merrick, Saxe, James B., Sipser, Michael
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.1981
Subjects
Computer science
Logic arrays
Logic circuits
Mathematics
Polynomials
Programmable logic arrays
Testing
Turing machines
Very large scale integration
Writing
Online AccessGet full text

Cover

More Information
ISSN:0272-5428
DOI:10.1109/SFCS.1981.35