A nonapproximability result for finite function generation

DOI10.1016/S0020-0190(97)00112-9zbMath1337.68118OpenAlexW1994493976MaRDI QIDQ287157

Peter Jonsson

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00112-9

zbMATH Keywords

computational complexityapproximationfunction generationPSPACE

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Approximate formulas for some functions of prime numbers
• Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)
• Unnamed Item
• Unnamed Item

This page was built for publication: A nonapproximability result for finite function generation