Some aspects of studying an optimization or decision problem in different computational models
type: Item
instance of: scholarly article
title: Some aspects of studying an optimization or decision problem in different computational models
zbMATH Open document ID: 1058.90081
DOI: 10.1016/S0377-2217(02)00269-2
author: Klaus Meer
author: Gerhard-Wilhelm Weber
published in: European Journal of Operational Research
publication date: 2002-11-20T00:00:00Z
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1832953
zbMATH Keywords: Complexity theory
zbMATH Keywords: Algebraic models of computation
zbMATH Keywords: Linear and quadratic programming
zbMATH Keywords: Structure of complexity classes
zbMATH Keywords: Saturation
MaRDI profile type: Publication
cites work: Q3996675
cites work: A note on non-complete problems in \(NP_\mathbb{R}\)
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Q4293543
cites work: Q4381389
cites work: Efficient incremental algorithms for the sparse resultant and the mixed volume
cites work: Saturation and stability in the theory of computation over the reals
cites work: Machines Over the Reals and Non-Uniformity
cites work: On digital nondeterminism
cites work: Complexity estimates depending on condition and round-off error
cites work: On Quadratic Programming
cites work: Q4542570
cites work: Accessible telephone directories
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3050157
cites work: Q4002474
cites work: Computational complexity and feasibility of data processing and interval computations
cites work: Q4429353
cites work: On the Structure of Polynomial Time Reducibility
cites work: Elimination of quantifiers in algebraic structures
cites work: On the Structure of $\cal NP_\Bbb C$
cites work: On the complexity of quadratic programming in real number models of computation
cites work: A survey on real structural complexity theory
cites work: Towards a Genuinely Polynomial Algorithm for Linear Programming
cites work: P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\)
cites work: Some NP-complete problems in quadratic and nonlinear programming
cites work: The real number model in numerical analysis
cites work: Q4841154
cites work: Incorporating Condition Measures into the Complexity Theory of Linear Programming
cites work: Q4279734
cites work: On the existence of generally convergent algorithms
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
cites work: Q3993279
cites work: Complexity of linear programming
cites work: A primal-dual interior point method whose running time depends only on the constraint matrix
cites work: On the complexity of linear programming under finite precision arithmetic
cites work: Q3751553
full work available at URL: s0377-2217(02)00269-2
OpenAlex ID: W2153485748
description: scientific article; zbMATH DE number 1832953