Semi-algebraic complexity -- Additive complexity of matrix computational tasks
type: Item
instance of: scholarly article
title: Semi-algebraic complexity -- Additive complexity of matrix computational tasks
zbMATH Open document ID: 0887.68038
author: Thomas Lickteig
author: Klaus Meer
published in: Journal of Complexity
publication date: 1997-08-26T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1040688
zbMATH Keywords: matrix computational tasks
MaRDI profile type: Publication
full work available at URL: jcom.1997.0430
OpenAlex ID: W2071763554
cites work: The complexity of partial derivatives
cites work: On the real spectrum of a ring and its application to semialgebraic geometry
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Some computational problems in linear algebra as hard as matrix multiplication
cites work: Q3770650
cites work: La topologie du spectre réel
cites work: On the Asymptotic Complexity of Matrix Multiplication
cites work: Matrix multiplication via arithmetic progressions
cites work: Lectures on the complexity of bilinear problems
cites work: Q4693114
cites work: Semi-algebraic decision complexity, the real spectrum, and degree
cites work: Q4361549
cites work: Semi-algebraic complexity of quotients and sign determination of remainders
cites work: Taylor expansion of the accumulated rounding error
cites work: How to multiply matrices faster
cites work: Q3961580
cites work: Q3823143
cites work: On the number of multiplications necessary to compute certain functions
DOI: 10.1006/JCOM.1997.0430
description: scientific article; zbMATH DE number 1040688