The following pages link to The Complexity of Bit Retrieval (Q4566643):
Displaying 11 items.
- Matrix product constraints by projection methods (Q1675556) (← links)
- Learning without loss (Q2138443) (← links)
- Circumcentering reflection methods for nonconvex feasibility problems (Q2158827) (← links)
- Applying iterated mapping to the no-three-in-a-line problem (Q2163429) (← links)
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems (Q2189471) (← links)
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD (Q4992365) (← links)
- Toward a Mathematical Theory of the Crystallographic Phase Retrieval Problem (Q5027012) (← links)
- Benchmark Problems for Phase Retrieval (Q5230417) (← links)
- Finite alphabet phase retrieval (Q6172171) (← links)
- No existence of a linear algorithm for the one-dimensional Fourier phase retrieval (Q6649702) (← links)
- The beltway problem over orthogonal groups (Q6652585) (← links)
