Some implications of interval approach to dimension for network complexity
From MaRDI portal
Publication:2093971
Recommendations
Cites work
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Complexity estimates based on integral transforms induced by computational units
- Concentration of Measure for the Analysis of Randomized Algorithms
- Feedforward Neural Network Methodology
- scientific article; zbMATH DE number 109318 (Why is no real title available?)
- scientific article; zbMATH DE number 1149836 (Why is no real title available?)
- scientific article; zbMATH DE number 1182753 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- Probability Inequalities for Sums of Bounded Random Variables
- Quasiorthogonal dimension of Euclidean spaces
- Weighted sums of certain dependent random variables
Cited in
(3)
This page was built for publication: Some implications of interval approach to dimension for network complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2093971)