Algebraic dependences and reducibilities of constructivizations in universal domains
From MaRDI portal
Publication:1914756
zbMath0849.03024MaRDI QIDQ1914756
Publication date: 28 August 1996
Published in: Siberian Advances in Mathematics (Search for Journal in Brave)
reducibilityalgorithmic complexityalgebraic dependenceuniversal domainsalgebraically closed fieldsalgebraic fieldconstructivizations
Analysis of algorithms and problem complexity (68Q25) Computable structure theory, computable model theory (03C57) Model theory of fields (12L12)
Related Items (2)
Existence and uniqueness of structures computable in polynomial time ⋮ Structures computable in polynomial time. II
This page was built for publication: Algebraic dependences and reducibilities of constructivizations in universal domains
