Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity
- Cite this paper as:
- Bshouty N.H., Mazzawi H. (2010) Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity. In: Hliněný P., Kučera A. (eds) Mathematical Foundations of Computer Science 2010. MFCS 2010. Lecture Notes in Computer Science, vol 6281. Springer, Berlin, Heidelberg
To obtain this result, our algorithm makes use of search matrices, the divide and conquer approach and the guess and check approach.
When combining these methods with the technique introduced in [Optimally Reconstructing Weighted Graphs Using Queries. SODA, 2010], we get a similar positive result for the problem of reconstructing a hidden weighted graph using additive queries.
Unable to display preview. Download preview PDF.