On the Incompressibility of Monotone DNFs Matthias P. Krieger∗ Johann Wolfgang Goethe-Universit¨at Frankfurt am Main Institut f¨ ur Informatik Lehrstuhl f¨ - ACC0 - Document - PDFSEARCH.IO

First Page	Meta Content
	On the Incompressibility of Monotone DNFs Matthias P. Krieger∗ Johann Wolfgang Goethe-Universit¨at Frankfurt am Main Institut f¨ ur Informatik Lehrstuhl f¨ Add to Reading List Document Date: 2010-11-03 11:40:59 Open Document File Size: 203,43 KB Share Result on Facebook Company BP / / / IndustryTerm directed switching networks / monotone broom-like formula computing / / Organization US Federal Reserve / Main Institut f¨ / / Person Matthias P. Krieger∗ Johann Wolfgang / / Technology simulation / / SocialTag Circuit complexity Computational complexity theory Boolean algebra Complexity classes Implicant Logic in computer science Boolean circuit Circuit ACC0 Theoretical computer science

On the Incompressibility of Monotone DNFs Matthias P. Krieger∗ Johann Wolfgang Goethe-Universit¨at Frankfurt am Main Institut f¨ ur Informatik Lehrstuhl f¨Add to Reading List