AbstractThe complexity of linearly constrained (nonconvex) quadratic programming is analyzed within the framework of real number models, namely the one of Blum, Shub, and Smale and its modification recently introduced by Koiran (“weak BSS-model”). In particular we show that this problem is not NP-complete in the Koiran setting. Applications to the (full) BSS-model are discussed
We briefly survey recent computational complexity results for certain algebraic problems that are re...
AbstractThis paper deals with issues of structural complexity in a linear version of the Blum-Shub-S...
AbstractThe concept of nondeterministic computation has been playing an important role in discrete c...
AbstractThe complexity of linearly constrained (nonconvex) quadratic programming is analyzed within ...
The complexity of linear programming is discussed in the "integer" and "real number" models of compu...
AbstractWhen comparing complexity theory over the ring Z (Turing machine) on one hand and over the r...
AbstractWe consider the Blum–Shub–Smale model of computation over the reals. It was shown that the L...
We study the parameterized complexity of Integer Quadratic Programming under two kinds of restrictio...
We study the parameterized complexity of Integer Quadratic Programming under two kinds of restrictio...
We study two quite different approaches to understanding the complexity of fundamental problems in n...
AbstractWe consider the problem of determining the fewest number of nonscalar multiplications needed...
We show some problems coming from real algebra and semi-algebraic geometry to be NP-complete or coNP...
AbstractThis paper presents results connected with the theory of computation over the reals, develop...
AbstractThe real-number model of computation is used in computational geometry, in the approach sugg...
Abstract. The paper describes a class of mathematical problems at an intersection of operator theory...
We briefly survey recent computational complexity results for certain algebraic problems that are re...
AbstractThis paper deals with issues of structural complexity in a linear version of the Blum-Shub-S...
AbstractThe concept of nondeterministic computation has been playing an important role in discrete c...
AbstractThe complexity of linearly constrained (nonconvex) quadratic programming is analyzed within ...
The complexity of linear programming is discussed in the "integer" and "real number" models of compu...
AbstractWhen comparing complexity theory over the ring Z (Turing machine) on one hand and over the r...
AbstractWe consider the Blum–Shub–Smale model of computation over the reals. It was shown that the L...
We study the parameterized complexity of Integer Quadratic Programming under two kinds of restrictio...
We study the parameterized complexity of Integer Quadratic Programming under two kinds of restrictio...
We study two quite different approaches to understanding the complexity of fundamental problems in n...
AbstractWe consider the problem of determining the fewest number of nonscalar multiplications needed...
We show some problems coming from real algebra and semi-algebraic geometry to be NP-complete or coNP...
AbstractThis paper presents results connected with the theory of computation over the reals, develop...
AbstractThe real-number model of computation is used in computational geometry, in the approach sugg...
Abstract. The paper describes a class of mathematical problems at an intersection of operator theory...
We briefly survey recent computational complexity results for certain algebraic problems that are re...
AbstractThis paper deals with issues of structural complexity in a linear version of the Blum-Shub-S...
AbstractThe concept of nondeterministic computation has been playing an important role in discrete c...
DOI
Add to ORKG