Proving completeness by logic
From MaRDI portal
Publication:4653719
DOI10.1080/00207160412331296625zbMath1079.68042OpenAlexW2088467794MaRDI QIDQ4653719
Vangelis Th. Paschos, Bruno Escoffier
Publication date: 7 March 2005
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160412331296625
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Descriptive complexity and finite models (68Q19)
Related Items (2)
Polynomial approximation: a structural and operational study. (Abstract of thesis) ⋮ A survey on the structure of approximation classes
Cites Work
This page was built for publication: Proving completeness by logic
