A Lower Bound of the Number of Threshold Functions
From MaRDI portal
Recommendations
Cited in
(24)- A lower time bound for the knapsack problem on random access machines
- A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem
- Size of ordered binary decision diagrams representing threshold functions
- Simplified Reed-Muller expressions for residue threshold functions
- On Boolean threshold functions with minimum specification number
- Root cones and the resonance arrangement
- Asymptotics of the number of threshold functions and the singularity probability of random \( \{\pm 1\}\)-matrices
- Junta threshold for low degree Boolean functions on the slice
- Thresholds of prox-boundedness of PLQ functions
- A better upper bound on weights of exact threshold functions
- Bounds for the number of threshold functions
- scientific article; zbMATH DE number 5005275 (Why is no real title available?)
- scientific article; zbMATH DE number 4135871 (Why is no real title available?)
- scientific article; zbMATH DE number 3902556 (Why is no real title available?)
- scientific article; zbMATH DE number 4079328 (Why is no real title available?)
- Algebraic aspects of threshold logic
- A threshold function in the Shannon effect for Boolean functions
- On the number of threshold functions
- Properties of a class of bi-threshold Boolean functions and estimates of the number of its elements
- Weights of exact threshold functions
- On the constructive characterization of threshold functions
- scientific article; zbMATH DE number 3257823 (Why is no real title available?)
- On combining Arbiter based PUFs
- A 2.5 n lower bound on the monotone network complexity of \(T^ n_ 3\)
This page was built for publication: A Lower Bound of the Number of Threshold Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5507975)
