Semi-algebraic decision complexity, the real spectrum, and degree
type: Item
instance of: scholarly article
title: Semi-algebraic decision complexity, the real spectrum, and degree
zbMATH Open document ID: 0853.68091
DOI: 10.1016/0022-4049(95)00105-0
author: Thomas Lickteig
published in: Journal of Pure and Applied Algebra
publication date: 1996-12-12T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 14P10
zbMATH DE Number: 896570
zbMATH Keywords: real spectrum
zbMATH Keywords: semi-algebraic
zbMATH Keywords: decision complexity
MaRDI profile type: Publication
full work available at URL: 0022-4049(95)00105-0
OpenAlex ID: W2077323669
cites work: The complexity of partial derivatives
cites work: On the real spectrum of a ring and its application to semialgebraic geometry
cites work: Heterogeneous algebras
cites work: Q3770650
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: On randomized semi-algebraic test complexity
cites work: Verification complexity of linear prime ideals
cites work: Test complexity of generic polynomials
cites work: Q5515373
cites work: Q3867914
cites work: Q5572358
cites work: Lower bounds on testing membership to a polyhedron by algebraic decision trees
cites work: Q3313974
cites work: Definability and fast quantifier elimination in algebraically closed fields
cites work: Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs
cites work: Q4693114
cites work: Q3869440
cites work: Q3773338
cites work: Taylor expansion of the accumulated rounding error
cites work: Q5611879
cites work: A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
cites work: On the Betti Numbers of Real Varieties
cites work: Lower bounds for arithmetic networks. II: Sum of Betti numbers
cites work: Lower bounds for arithmetic networks
cites work: Q3973344
cites work: Q3347289
cites work: Q4124196
cites work: Q3340956
cites work: Q4724592
cites work: Q3961580
cites work: An Extension of Strassen’s Degree Bound
cites work: Q5614117
cites work: An elementary proof for Strassen's degree bound
cites work: Lower bounds for algebraic decision trees
cites work: The complexity of evaluating interpolation polynomials
cites work: Berechnung und Programm. I
cites work: Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
cites work: The Computational Complexity of Continued Fractions
cites work: Q5511997
cites work: Lectures on results on Bezout's theorem. Notes by D. P. Patil
cites work: Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
cites work: Q4230349
description: scientific article; zbMATH DE number 896570