On topological lower bounds for algebraic computation trees

Andrei Gabrielov, Nicolai Vorobjov

Research output: Contribution to journalArticle

1 Citation (Scopus)
Original languageEnglish
Pages (from-to)61-72
Number of pages12
JournalFoundations of Computational Mathematics
Volume17
Issue number1
Early online date27 Aug 2015
DOIs
Publication statusPublished - 1 Feb 2017

Keywords

  • computational complexity
  • algebraic computation trees
  • semialgebraic sets

Cite this

On topological lower bounds for algebraic computation trees. / Gabrielov, Andrei; Vorobjov, Nicolai.

In: Foundations of Computational Mathematics, Vol. 17, No. 1, 01.02.2017, p. 61-72.

Research output: Contribution to journalArticle

@article{c64db809f62444888b0c39f0bad337a9,
title = "On topological lower bounds for algebraic computation trees",
keywords = "computational complexity, algebraic computation trees, semialgebraic sets",
author = "Andrei Gabrielov and Nicolai Vorobjov",
year = "2017",
month = "2",
day = "1",
doi = "10.1007/s10208-015-9283-7",
language = "English",
volume = "17",
pages = "61--72",
journal = "Foundations of Computational Mathematics",
issn = "1615-3375",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - On topological lower bounds for algebraic computation trees

AU - Gabrielov, Andrei

AU - Vorobjov, Nicolai

PY - 2017/2/1

Y1 - 2017/2/1

KW - computational complexity

KW - algebraic computation trees

KW - semialgebraic sets

UR - http://arxiv.org/pdf/1502.04341v2

UR - http://dx.doi.org/10.1007/s10208-015-9283-7

U2 - 10.1007/s10208-015-9283-7

DO - 10.1007/s10208-015-9283-7

M3 - Article

VL - 17

SP - 61

EP - 72

JO - Foundations of Computational Mathematics

JF - Foundations of Computational Mathematics

SN - 1615-3375

IS - 1

ER -