Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity

DOI10.1007/978-3-642-15155-2_21zbMath1287.68070OpenAlexW1572167217MaRDI QIDQ3586086

Hanna Mazzawi, Nader H. Bshouty

Publication date: 3 September 2010

Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15155-2_21

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Related Items (1)

Toward a deterministic polynomial time algorithm with optimal additive query complexity

This page was built for publication: Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity