Real data-integer solution problems within the Blum-Shub-Smale computational model
type: Item
instance of: scholarly article
title: Real data-integer solution problems within the Blum-Shub-Smale computational model
zbMATH Open document ID: 0880.68035
author: Valentin E. Brimkov
author: Stephan Stoyanov Danchev
published in: Journal of Complexity
publication date: 1997-11-20T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 90C99
zbMATH DE Number: 1069070
zbMATH Keywords: integer linear programming problem
zbMATH Keywords: linear diophantine equation
MaRDI profile type: Publication
full work available at URL: jcom.1997.0446
OpenAlex ID: W1965532798
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Q4109684
cites work: Q4198056
cites work: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
cites work: Factoring polynomials with rational coefficients
cites work: Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
cites work: Integer Programming with a Fixed Number of Variables
cites work: Computations over \(\mathbb{Z}\) and \(\mathbb{R}\): a comparison
cites work: A note on a \(P \neq NP\) result for a restricted class of real machines
cites work: Real number models under various sets of operations
cites work: Q4197343
cites work: Q3818127
cites work: Factoring numbers in O(log n) arithmetic steps
cites work: Some Remarks on the Foundations of Numerical Analysis
DOI: 10.1006/JCOM.1997.0446
description: scientific article; zbMATH DE number 1069070