On topological lower bounds for algebraic computation trees

Andrei Gabrielov, Nicolai Vorobjov

Research output: Contribution to journalArticlepeer-review

4 Citations (SciVal)
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