2005•Journal of ComplexityOpen access

Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets

Peter Bürgisser, Felipe Cucker

Open full text 55 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 55 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Mathematics, Betti number, Counting problem, Euler characteristic, Discrete mathematics, Real algebraic geometry, Algebraic number, Homology (biology)

Back to paper search Browse research topics Original source

Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets — Research Paper | ScholarLens