Lower bounds for some decision problems over \(C\)

DOI10.1016/S0304-3975(01)00273-0zbMath1002.68162arXivmath/9904129WikidataQ127778762 ScholiaQ127778762MaRDI QIDQ1605321

Gregorio Malajovich

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9904129

zbMATH Keywords

decision problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• On lower bounds for the complexity of polynomials and their multiples
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Polynomials with Rational Coefficients Which are Hard to Compute
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounds for some decision problems over \(C\)