Approximating Boolean functions by OBDDs (Q867861)

From MaRDI portal

Revision as of 13:55, 25 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Approximating Boolean functions by OBDDs	scientific article

Statements

scholarly article

0 references

Approximating Boolean functions by OBDDs (English)

0 references

André Gronemeier

0 references

Discrete Applied Mathematics

0 references

publication date

19 February 2007

0 references

zbMATH Keywords

OBDD

0 references

communication complexity

0 references

approximation

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.dam.2006.04.037

0 references

A lower bound for integer multiplication on randomized ordered read-once branching programs.

0 references

On the Complexity of the Hidden Weighted Bit Function for Various BDD Models

0 references

On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs

0 references

Read-once projections and formal circuit verification with binary decision diagrams

0 references

A read-once branching program lower bound of Ω(2 <sup>n/4</sup> ) for integer multiplication using universal hashing

0 references

Graph-Based Algorithms for Boolean Function Manipulation

0 references

On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication

0 references

A Reliable Randomized Algorithm for the Closest-Pair Problem

0 references

0 references

Communication Complexity

0 references

0 references

Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions

0 references

0 references

Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions

0 references

Branching Programs and Binary Decision Diagrams

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.dam.2006.04.037

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:867861

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q867861&oldid=34922514"