A note on Rabin's width of a complete proof

DOI10.1007/BF01205053zbMath0806.68062OpenAlexW2069741443MaRDI QIDQ1327592

Tomás Recio, José Luis Montaña, Luis Miguel Pardo

Publication date: 19 June 1994

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01205053

zbMATH Keywords

decisional complexitiesgeneric width

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Nash functions and manifolds (14P20)

Related Items

On decision trees for orthants ⋮ Randomization and the computational power of analytic and algebraic decision trees ⋮ Decision trees: Old and new results. ⋮ On the decisional complexity of problems over the reals

Cites Work

• Sur la factorialite des anneaux de fonctions de Nash
• Proving simultaneous positivity of linear forms
• Sur l'anneau des fonctions de Nash globales
• Unnamed Item
• Unnamed Item
• Unnamed Item