scientific article; zbMATH DE number 549860
From MaRDI portal
Publication:4287364
zbMATH Open0801.68077MaRDI QIDQ4287364FDOQ4287364
Authors: Janos Simon, Mario Szegedy 
Publication date: 8 December 1994
Title of this publication is not available (Why is that?)
Recommendations
Cited In (19)
- Almost \(k\)-wise independence and hard Boolean functions.
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice
- The complexity of minimizing and learning OBDDs and FBDDs
- Streaming and query once space complexity of longest increasing subsequence
- A simple function that requires exponential size read-once branching programs
- A very simple function that requires exponential size read-once branching programs.
- A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs
- Communication Complexity and Lower Bounds on Multilective Computations
- A lower bound for read-once-only branching programs
- A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds
- A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3
- Perspective on complexity measures targeting read-once branching programs
- Randomization and nondeterminism are comparable for ordered read-once branching programs
- On lower bounds for read-\(k\)-times branching programs
- Time-space tradeoffs for branching programs
- Title not available (Why is that?)
- The simplified weighted sum function and its average sensitivity
- BDDs -- design, analysis, complexity, and applications.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287364)
