Lower bounds for linear decision lists
From MaRDI portal
Recommendations
Cites work
- Harmonic Analysis of Polynomial Threshold Functions
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 1008380 (Why is no real title available?)
- scientific article; zbMATH DE number 5937160 (Why is no real title available?)
- On the computational power of Boolean decision lists
- Optimal numberings and isoperimetric problems on graphs
- Some intersection theorems for ordered sets and graphs
Cited in
(8)- Lower bounds for some decision problems over \(C\)
- Proof complexity of symbolic QBF reasoning
- Decision lists and related classes of Boolean functions
- scientific article; zbMATH DE number 1008380 (Why is no real title available?)
- Lower bounds for monotonic list labeling
- Decision List Compression by Mild Random Restrictions
- Lower bounds for linear decision trees with bounded weights
- Linear threshold functions in decision lists, decision trees, and depth-2 circuits
This page was built for publication: Lower bounds for linear decision lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988300)