Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity

Nader H. Bshouty, Hanna Mazzawi. Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity. In Petr Hlinený, Antonín Kucera, editors, Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings. Volume 6281 of Lecture Notes in Computer Science, pages 221-232, Springer, 2010. [doi]

Authors

Nader H. Bshouty

This author has not been identified. Look up 'Nader H. Bshouty' in Google

Hanna Mazzawi

This author has not been identified. Look up 'Hanna Mazzawi' in Google