scientific article; zbMATH DE number 549860
From MaRDI portal
Publication:4287364
zbMath0801.68077MaRDI QIDQ4287364
Publication date: 8 December 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
The complexity of minimizing and learning OBDDs and FBDDs ⋮ On lower bounds for read-\(k\)-times branching programs ⋮ A simple function that requires exponential size read-once branching programs ⋮ Communication Complexity and Lower Bounds on Multilective Computations ⋮ Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice ⋮ Randomization and nondeterminism are comparable for ordered read-once branching programs ⋮ A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds ⋮ Almost \(k\)-wise independence and hard Boolean functions. ⋮ A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds ⋮ BDDs -- design, analysis, complexity, and applications. ⋮ The simplified weighted sum function and its average sensitivity ⋮ A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs ⋮ A very simple function that requires exponential size read-once branching programs. ⋮ Time-space tradeoffs for branching programs
This page was built for publication:
