Entropy of contact circuits and lower bounds on their complexity
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3890736 (Why is no real title available?)
- scientific article; zbMATH DE number 3815533 (Why is no real title available?)
- scientific article; zbMATH DE number 3913677 (Why is no real title available?)
- scientific article; zbMATH DE number 3919835 (Why is no real title available?)
- scientific article; zbMATH DE number 3968573 (Why is no real title available?)
- scientific article; zbMATH DE number 3987204 (Why is no real title available?)
- scientific article; zbMATH DE number 4007722 (Why is no real title available?)
- scientific article; zbMATH DE number 3566175 (Why is no real title available?)
- scientific article; zbMATH DE number 3997703 (Why is no real title available?)
- scientific article; zbMATH DE number 3999837 (Why is no real title available?)
- scientific article; zbMATH DE number 3257409 (Why is no real title available?)
- Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
- Bounds for Width Two Branching Programs
- Lower bounds on monotone complexity of the logical permanent
- The complexity of symmetric functions in bounded-depth circuits
- The monotone circuit complexity of Boolean functions
Cited in
(27)- The simplified weighted sum function and its average sensitivity
- scientific article; zbMATH DE number 4002123 (Why is no real title available?)
- Neither reading few bits twice nor reading illegally helps much
- Lower bounds for linearly transformed OBDDs and FBDDs
- Almost \(k\)-wise independence and hard Boolean functions.
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines.
- Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
- Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
- A simple function that requires exponential size read-once branching programs
- A very simple function that requires exponential size read-once branching programs.
- Streaming and query once space complexity of longest increasing subsequence
- scientific article; zbMATH DE number 3390658 (Why is no real title available?)
- 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
- Prediction from partial information and hindsight, with application to circuit lower bounds
- A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds
- A hierarchy result for read-once branching programs with restricted parity nondeterminism
- scientific article; zbMATH DE number 4068270 (Why is no real title available?)
- scientific article; zbMATH DE number 4131667 (Why is no real title available?)
- Randomized OBDD-based graph algorithms
- Randomized OBDD-based graph algorithms
- Perspective on complexity measures targeting read-once branching programs
- Entropy and enumeration of Boolean functions
- Random problems
- scientific article; zbMATH DE number 6007838 (Why is no real title available?)
- scientific article; zbMATH DE number 3968573 (Why is no real title available?)
- scientific article; zbMATH DE number 3987204 (Why is no real title available?)
This page was built for publication: Entropy of contact circuits and lower bounds on their complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109754)
