Nearest neighbor complexity and Boolean circuits
From MaRDI portal
Cites work
- A generalized k-nearest neighbor rule
- A linear lower bound on the unbounded error probabilistic communication complexity.
- Boolean function complexity. Advances and frontiers.
- Constant depth circuits, Fourier transform, and learnability
- scientific article; zbMATH DE number 177818 (Why is no real title available?)
- scientific article; zbMATH DE number 1559576 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 1775451 (Why is no real title available?)
- Learnability beyond AC 0
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
- Linear threshold functions in decision lists, decision trees, and depth-2 circuits
- Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms
- Lower bounds for linear decision lists
- Majority gates vs. general weighted threshold gates
- Nearest neighbor pattern classification
- Nearest neighbor representations of Boolean functions
- On ACC
- On PAC learning algorithms for rich Boolean function classes
- On small depth threshold circuits
- On the asymptotic probability of error in nonparametric discrimination
- Polynomial threshold functions and Boolean threshold circuits
- Probabilistic polynomials and Hamming nearest neighbors
- Simulating Threshold Circuits by Majority Circuits
- The Sign-Rank of AC^0
- Threshold circuits of bounded depth
- Toward attribute efficient learning of decision lists and parities
This page was built for publication: Nearest neighbor complexity and Boolean circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296679)
