<--- Back to Details
First PageDocument Content
Logic gates / Mathematics / Mathematical logic / Algebra / Boolean algebra / Logic in computer science / Algebraic logic / Circuit complexity / Canonical normal form / Combinational logic / XOR gate / Digital electronics
Date: 2007-10-14 23:24:26
Logic gates
Mathematics
Mathematical logic
Algebra
Boolean algebra
Logic in computer science
Algebraic logic
Circuit complexity
Canonical normal form
Combinational logic
XOR gate
Digital electronics

CS61c: Representations of Combinational Logic Circuits J. Wawrzynek October 12, 2007 1

Add to Reading List

Source URL: www-inst.eecs.berkeley.edu

Download Document from Source Website

File Size: 347,83 KB

Share Document on Facebook

Similar Documents

HP 35s Scientific Calculator Get professional performance from the ultimate RPN scientific programmable calculator. Switch between RPN* and algebraic entry-system logic at any time. The HP 35s features

HP 35s Scientific Calculator Get professional performance from the ultimate RPN scientific programmable calculator. Switch between RPN* and algebraic entry-system logic at any time. The HP 35s features

DocID: 1uXjF - View Document

Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, An Algebraic Approach to Dynamic Epistemic Logic Prakash Panangaden1 , Caitlin Phillips1 , Doina Precup1 , and Mehrnoosh Sadr

Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, An Algebraic Approach to Dynamic Epistemic Logic Prakash Panangaden1 , Caitlin Phillips1 , Doina Precup1 , and Mehrnoosh Sadr

DocID: 1tdJ8 - View Document

Games in algebraic logic: axiomatisations and beyond Robin Hirsch and Ian Hodkinson Department of Computer Science, University College London, UK Department of Computing, Imperial College London, UK March 6, 2005

Games in algebraic logic: axiomatisations and beyond Robin Hirsch and Ian Hodkinson Department of Computer Science, University College London, UK Department of Computing, Imperial College London, UK March 6, 2005

DocID: 1t7HB - View Document

Efficient Reasoning with Range and Domain Constraints Dmitry Tsarkov and Ian Horrocks Department of Computer Science The University of Manchester Manchester, UK {tsarkov|horrocks}@cs.man.ac.uk

Efficient Reasoning with Range and Domain Constraints Dmitry Tsarkov and Ian Horrocks Department of Computer Science The University of Manchester Manchester, UK {tsarkov|horrocks}@cs.man.ac.uk

DocID: 1rnPM - View Document

CONTRIBUTED TALK ABSTRACTS 1.2  JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent devel

CONTRIBUTED TALK ABSTRACTS 1.2 JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent devel

DocID: 1rm3f - View Document