No existence of a linear algorithm for the one-dimensional Fourier phase retrieval
From MaRDI portal
Publication:6649702
DOI10.1016/j.jco.2024.101886MaRDI QIDQ6649702
Publication date: 6 December 2024
Published in: Journal of Complexity (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Unnamed Item
- A generic approach to proving NP-hardness of partition type problems
- The Pauli problem, state reconstruction and quantum-real numbers
- Ambiguities in one-dimensional discrete phase retrieval from Fourier magnitudes
- ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
- Enforcing uniqueness in one-dimensional phase retrieval by additional signal information in time domain
- On signal reconstruction from FROG measurements
- A point set puzzle revisited
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- There Are No Further Counterexamples to S. Piccard's Theorem
- Signal reconstruction from phase or magnitude
- `` Strong NP-Completeness Results
- The Complexity of Bit Retrieval
- Non-Convex Phase Retrieval From STFT Measurements
- Sparse Phase Retrieval: Uniqueness Guarantees and Recovery Algorithms
- Phase Retrieval from 1D Fourier Measurements: Convexity, Uniqueness, and Algorithms
- Relaxed averaged alternating reflections for diffraction imaging
- Semidefinite Programming
- Toward a Mathematical Theory of the Crystallographic Phase Retrieval Problem
- Benchmark Problems for Phase Retrieval
- Reconstruction of Signals From Their Autocorrelation and Cross-Correlation Vectors, With Applications to Phase Retrieval and Blind Channel Estimation
- Phase Retrieval via Matrix Completion
This page was built for publication: No existence of a linear algorithm for the one-dimensional Fourier phase retrieval
