Real data-integer solution problems within the Blum-Shub-Smale computational model
From MaRDI portal
Publication:1368838
DOI10.1006/jcom.1997.0446zbMath0880.68035OpenAlexW1965532798MaRDI QIDQ1368838
Valentin E. Brimkov, Stefan S. Dantchev
Publication date: 20 November 1997
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1997.0446
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
On the polyhedral complexity of the integer points in a hyperball ⋮ Some theoretical challenges in digital geometry: a perspective ⋮ Exact Image Reconstruction from a Single Projection through Real Computation ⋮ An alternative to Ben-Or's lower bound for the knapsack problem complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computations over \(\mathbb{Z}\) and \(\mathbb{R}\): a comparison
- Factoring polynomials with rational coefficients
- A note on a \(P \neq NP\) result for a restricted class of real machines
- Factoring numbers in O(log n) arithmetic steps
- Real number models under various sets of operations
- Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
- Integer Programming with a Fixed Number of Variables
- Some Remarks on the Foundations of Numerical Analysis
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
This page was built for publication: Real data-integer solution problems within the Blum-Shub-Smale computational model
