scientific article; zbMATH DE number 1405644
From MaRDI portal
Publication:4938624
zbMath0941.68567MaRDI QIDQ4938624
Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim, Alexander E. Andreev
Publication date: 10 July 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice ⋮ 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 ⋮ The simplified weighted sum function and its average sensitivity ⋮ Representation of graphs by OBDDs ⋮ A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs ⋮ Mining circuit lower bound proofs for meta-algorithms
This page was built for publication:
