CS 170 Algorithms Spring 2009

First Page		Document Content
Date: 2009-05-04 23:56:17 Complexity classes NP-complete problems Boolean algebra Electronic design automation Formal methods Boolean satisfiability problem Conjunctive normal form NP-complete Canonical form Theoretical computer science Mathematics Applied mathematics		CS 170 Algorithms Spring 2009 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Download Document from Source Website File Size: 99,50 KB Share Document on Facebook

	EE263 AutumnS. Boyd and S. Lall Jordan canonical form DocID: 1usxU - View Document
	206 Enhancing the Jordan canonical form Anthony Henderson∗ Abstract DocID: 1tqfK - View Document
	CS61c: Representations of Combinational Logic Circuits J. Wawrzynek October 12, 2007 1 DocID: 1r4rE - View Document
	cs281: Computer Organization Lab2 Prelab The purpose of this prelab is to introduce some of the fundamentals of Combinational Logic Design, preparing us for using the breadboards to build circuits designed in this Prela DocID: 1qOLl - View Document
	Microsoft Word - IBSdoc DocID: 1qERD - View Document