On Search Problems in Complexity Theory and in Logic (Abstract)

DOI10.1007/11758471_3zbMATH Open1183.68315OpenAlexW2135963928MaRDI QIDQ3434537

Could not fetch data.

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11758471_3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

Related Items (1)

On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus

This page was built for publication: On Search Problems in Complexity Theory and in Logic (Abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434537)