Contents Part I The Basics

First Page		Document Content
Date: 2012-03-10 09:16:28 Complexity classes Circuit complexity Natural proof Switching lemma ACC0 NC P Binary decision diagram Clique Theoretical computer science Computational complexity theory Applied mathematics		Contents Part I The Basics Add to Reading List Source URL: www.thi.informatik.uni-frankfurt.de Download Document from Source Website File Size: 97,09 KB Share Document on Facebook

	Exact Computation of Inﬂuence Spread by Binary Decision Diagram Takanori Maehara1) , Hirofumi Suzuki2) , Masakazu Ishihata2) 1) Riken Center for Advanced Intelligence Project 2) Hokkaido University DocID: 1vinU - View Document
	Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation ∗ Department Yan Chen∗, Yujing He∗ , Fei Xie∗ and Jin Yang† of Computer Science, Portland State University, Portland, OR 97207. {c DocID: 1riqj - View Document
	A BDD Representation for Positive Equational Formulas Wenxin Song, Eugene W. Stark? Department of Computer Science State University of New York at Stony Brook DocID: 1qPwp - View Document
	Parallel Disk-Based Computation for Large, Monolithic Binary Decision Diagrams Daniel Kunkle∗ Vlad Slavici DocID: 1qvcw - View Document
	Context-Sensitive Program Analysis as Database Queries Monica S. Lam John Whaley V. Benjamin Livshits Michael C. Martin Dzintars Avots DocID: 1qtLT - View Document