Toggle navigation
Search
Browse
EKT item types
Institutions
Collections
Interoperability
Info
The project
Help
For institutions
Contribute
Publication Requirements
Expression of Interest Form
Contact
ΕΛ
•
ΕΝ
In all fields
Subject
Type
Location
Title
Time
Creator/contributor
×
+
Search
Clear
Help
Modelling the complexity of parallel and VLSI computations with Boolean circuits
This item is provided by the institution :
National Technical University of Athens
Repository :
Digital Library of National Technical University of Athens | Dspace@NTUA
see the original item page
in the repository's web site and access all digital files if the item
*
share
Semantic enrichment by EKT
ΕΚΤ item type
Journal part
(EN)
Scientific article
(EN)
EKT year
1995
(EN)
EKT historical period
Title
Modelling the complexity of parallel and VLSI computations with Boolean circuits (EN)
Creator
Papadopoulos, CV (EN)
Andronikos, TS (EN)
Description
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)
Type
journalArticle (EN)
Subject
VLSI circuits (EN)
Engineering, Electrical & Electronic (EN)
Computer Science, Theory & Methods (EN)
Sequential complexity (EN)
sequential complexity (EN)
Boolean algebra (EN)
Computational complexity (EN)
lower bounds (EN)
Parallel processing systems (EN)
Lower bounds (EN)
Algorithms (EN)
Turing machines (EN)
Logic circuits (EN)
Computer Science, Hardware & Architecture (EN)
Mathematical models (EN)
Boolean circuits (EN)
Provider
National Technical University of Athens
Repository / collection
Digital Library of National Technical University of Athens | Dspace@NTUA
Subcollections
Κεντρική Βιβλιοθήκη Ε.Μ.Π.
Ιδρυματικό Αποθετήριο
Δημοσιεύσεις μελών Δ.Ε.Π. σε περιοδικά
Journal
Microprocessors and Microsystems (EN)
Language
English
Issued
1995 (EN)
Identifier
http://hdl.handle.net/123456789/11584
1 (EN)
0141-9331 (EN)
10.1016/0141-9331(95)93087-Y (EN)
ISI:A1995QK54200006 (EN)
19 (EN)
50 (EN)
43 (EN)
Publisher
BUTTERWORTH-HEINEMANN LTD (EN)
*
Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)
×
×
Βοηθείστε μας να κάνουμε καλύτερο το
OpenArchives
.gr
.
Πάρτε μέρος στη σύντομη έρευνα!