scientific article; zbMATH DE number 1834636
From MaRDI portal
Publication:4779131
zbMath0999.68083MaRDI QIDQ4779131
Publication date: 25 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Few Product Gates But Many Zeros ⋮ VPSPACE and a transfer theorem over the complex field
This page was built for publication:
