Skip to main content
Conference Proceedings

Boolean circuit complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 650 LNCS 1
DOI: 10.1007/3-540-56279-6_71
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The talk will survey some old, and some recent, results relating to Boolean circuits, and will concentrate particularly on the lower levels of complexity.

Cite

CITATION STYLE

APA

Paterson, M. (1992). Boolean circuit complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 650 LNCS, p. 1). Springer Verlag. https://doi.org/10.1007/3-540-56279-6_71

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free