The complexity of analytic tableaux

DOI10.1145/380752.380822zbMath1323.03089OpenAlexW2039214864MaRDI QIDQ5175990

Alasdair Urquhart, Noriko H. Arai, Toniann Pitassi

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380822

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

Related Items (1)

A Logical Autobiography

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: The complexity of analytic tableaux