Applying iterated mapping to the no-three-in-a-line problem
From MaRDI portal
(Redirected from Publication:2163429)
Recommendations
Cites work
- A numerically stable dual method for solving strictly convex quadratic programs
- Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming
- Generalizations of the no-three-in-a-line problem
- Holographic phase retrieval and reference design
- Noise Limits on Reconstructing Diffraction Signals From Random Tomographs
- Progress in the no-three-in-line problem. II
- Progress in the no-three-in-line-problem
- Searching with iterated maps
- Solving graph coloring problems with the Douglas-Rachford algorithm
- Stability and accuracy of inexact interior point methods for convex quadratic programming
- The Complexity of Bit Retrieval
- The No-Three-In-Line Problem
Cited in
(3)
This page was built for publication: Applying iterated mapping to the no-three-in-a-line problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163429)