Sciweavers

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

12

MFCS
2004
Springer

favoriteEmaildiscussreport

123views Theoretical Computer Science» more MFCS 2004»

Approximating Boolean Functions by OBDDs

13 years 9 months ago

Approximating Boolean Functions by OBDDs

Download www.cs.bham.ac.uk

In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximating Boolean functions with respect to given distributions on the inputs. We present a new type of reduction for one–round communication problems that is suitable for approximations. Using this new type of reduction, we prove the following results on OBDD approximations of Boolean functions:

Andre Gronemeier

Real-time Traffic

Approximations | Boolean Functions | MFCS 2004 | One–round Communication Problems |

claim paper

Related Content

» The IO Complexity of Ordered Binary Decision Diagram Manipulation

» Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard

» Ordered Kronecker functional decision diagramsa data structure for representation and mani...

» Ordered Binary Decision Diagrams and the DavisPutnam Procedure

» Secure function evaluation with ordered binary decision diagrams

» On Symbolic Scheduling Independent Tasks with Restricted Execution Times

» A uniform framework for weighted decision diagrams and its implementation

» New Bounds on the OBDDSize of Integer Multiplication via Universal Hashing

» New Compilation Languages Based on Structured Decomposability

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	MFCS
Authors	Andre Gronemeier

Comments (0)