The densest hemisphere problem
From MaRDI portal
Publication:1242681
DOI10.1016/0304-3975(78)90006-3zbMath0368.68053MaRDI QIDQ1242681
Franco P. Preparata, David S. Johnson
Publication date: 1978
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2142/74081
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68W99: Algorithms in computer science
Related Items
Training a Single Sigmoidal Neuron Is Hard, The complexity of linear programming, Discussion, Generating all vertices of a polyhedron is hard, Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning, A polynomial-time algorithm for computing the yolk in fixed dimension, Optimal length resolution refutations of difference constraint systems, On the computational complexity of the minimum committee problem, On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems, The hardness of approximate optima in lattices, codes, and systems of linear equations, The complexity and approximability of finding maximum feasible subsystems of linear relations, The computational complexity of densest region detection, Some connections between learning and optimization, On geometric optimization with few violated constraints, Analysis and test of efficient methods for building recursive deterministic perceptron neural networks, The instability of instability of centered distributions, A two-phase relaxation-based heuristic for the maximum feasible subsystem problem, On the Nonlearnability of a Single Spiking Neuron, Theory of Classification: a Survey of Some Recent Advances, Novel approaches to the discrimination problem
Cites Work
