Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

105

MST
2007

93views more MST 2007»

The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates

15 years 2 months ago

The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates

Download www.thi.uni-hannover.de

Elmar Böhler, Henning Schnoor

Real-time Traffic

MST 2007 |

claim paper

Related Content

» A framework for automated and optimized ASIP implementation supporting multiple hardware d...

» Discrepancy and the Power of Bottom Fanin in Depththree Circuits

» FairplayMP a system for secure multiparty computation

» Scalable exploration of functional dependency by interpolation and incremental SAT solving

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	MST
Authors	Elmar Böhler, Henning Schnoor

Comments (0)