Counting problems over the reals
type: Item
instance of: scholarly article
title: Counting problems over the reals
zbMATH Open document ID: 0947.68076
DOI: 10.1016/S0304-3975(98)00190-X
author: Klaus Meer
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D15
zbMATH DE Number: 1493350
zbMATH Keywords: counting problem
zbMATH Keywords: real number model
zbMATH Keywords: \(\mathbb R\)-structures
zbMATH Keywords: model theory
MaRDI profile type: Publication
cites work: Q3139554
cites work: Q3996250
cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Logics which capture complexity classes over the reals
cites work: Q4850061
cites work: Q4058132
cites work: Q4717945
cites work: Q3975179
cites work: A survey on real structural complexity theory
cites work: Optimization, approximation, and complexity classes
cites work: Universal resolution for NP-complete problems
cites work: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
cites work: Descriptive complexity of \(\#\)P functions
cites work: Complexity of Bezout's Theorem I: Geometric Aspects
cites work: The complexity of computing the permanent
description: scientific article; zbMATH DE number 1493350