Modelling the complexity of parallel and VLSI computations with Boolean circuits

Papadopoulos, CV; Andronikos, TS

dc.contributor.author	Papadopoulos, CV	en
dc.contributor.author	Andronikos, TS	en
dc.date.accessioned	2014-03-01T01:11:17Z
dc.date.available	2014-03-01T01:11:17Z
dc.date.issued	1995	en
dc.identifier.issn	0141-9331	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11584
dc.subject	Boolean circuits	en
dc.subject	lower bounds	en
dc.subject	sequential complexity	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.other	Algorithms	en
dc.subject.other	Boolean algebra	en
dc.subject.other	Logic circuits	en
dc.subject.other	Mathematical models	en
dc.subject.other	Parallel processing systems	en
dc.subject.other	Turing machines	en
dc.subject.other	VLSI circuits	en
dc.subject.other	Boolean circuits	en
dc.subject.other	Lower bounds	en
dc.subject.other	Sequential complexity	en
dc.subject.other	Computational complexity	en
dc.title	Modelling the complexity of parallel and VLSI computations with Boolean circuits	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/0141-9331(95)93087-Y	en
heal.identifier.secondary	http://dx.doi.org/10.1016/0141-9331(95)93087-Y	en
heal.language	English	en
heal.publicationDate	1995	en
heal.abstract	Complexity theory seeks to understand the resource requirements inherent in the solution of problems on computers. It also seeks to understand the relative computational power of different models. The Turing model is difficult to work with, in part because of the impossibility of studying strictly finite structures. Boolean circuits are playing a more important role in our understanding of computation. They are useful as models in situations as far removed as VLSI design and parallel computation. The branching program challenges our intuitions. It has been shown in an indirect fashion that constant-width branching programs can 'count', but not exactly how. Algebraic methods give a handle and allow us for the first time to study complicated combinatorial structures. © 1995.	en
heal.publisher	BUTTERWORTH-HEINEMANN LTD	en
heal.journalName	Microprocessors and Microsystems	en
dc.identifier.doi	10.1016/0141-9331(95)93087-Y	en
dc.identifier.isi	ISI:A1995QK54200006	en
dc.identifier.volume	19	en
dc.identifier.issue	1	en
dc.identifier.spage	43	en
dc.identifier.epage	50	en