On decision trees for orthants

DOI10.1016/S0020-0190(97)00073-2zbMath1337.68138OpenAlexW2025828974MaRDI QIDQ287088

V. A. Vassiliev

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00073-2

zbMATH Keywords

computational complexityNewton polyhedrondecision tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (2)

Topological complexity of zero finding with algebraic operations ⋮ Finding a vector orthogonal to roughly half a collection of vectors

Cites Work

• Unnamed Item
• A note on Rabin's width of a complete proof
• Proving simultaneous positivity of linear forms
• NORMAL FORMS OF FUNCTIONS IN NEIGHBOURHOODS OF DEGENERATE CRITICAL POINTS
• Decision tree complexity and Betti numbers

This page was built for publication: On decision trees for orthants