On topological lower bounds for algebraic computation trees

Andrei Gabrielov; Nicolai Vorobjov

doi:10.1007/s10208-015-9283-7

On topological lower bounds for algebraic computation trees

Andrei Gabrielov, Nicolai Vorobjov

Purdue University

Research output: Contribution to journal › Article › peer-review

5 Citations (SciVal)

Original language	English
Pages (from-to)	61-72
Number of pages	12
Journal	Foundations of Computational Mathematics
Volume	17
Issue number	1
Early online date	27 Aug 2015
DOIs	https://doi.org/10.1007/s10208-015-9283-7
Publication status	Published - 1 Feb 2017

Keywords

computational complexity
algebraic computation trees
semialgebraic sets

Access to Document

10.1007/s10208-015-9283-7

Cite this

@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 = feb,

day = "1",

doi = "10.1007/s10208-015-9283-7",

language = "English",

volume = "17",

pages = "61--72",

journal = "Foundations of Computational Mathematics",

issn = "1615-3383",

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

SN - 1615-3383

VL - 17

SP - 61

EP - 72

JO - Foundations of Computational Mathematics

JF - Foundations of Computational Mathematics

IS - 1

ER -

On topological lower bounds for algebraic computation trees

Keywords

Access to Document

Other files and links

Profiles

Nicolai Vorobjov

Cite this