Skip to Main content Skip to Navigation
Conference papers

On the Power of Additive Combinatorial Search Model

Vladimir Grebinski 1
1 POLKA - Polynomials, Combinatorics, Arithmetic
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We consider two generic problems of combinatorial search under the additive model. The first one is the problem of reconstructing bounded--weight vectors. We establish an optimal upper bound and observe that it unifies many known results for coin--weighing problems. The developed technique provides a basis for the graph reconstruction problem. Optimal upper bound is proven for the class of $k$--degenerate graphs.
Document type :
Conference papers
Complete list of metadata
Contributor : Publications Loria <>
Submitted on : Monday, September 25, 2006 - 5:03:57 PM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM


  • HAL Id : inria-00098615, version 1



Vladimir Grebinski. On the Power of Additive Combinatorial Search Model. Fourth Annual International Computing and Combinatorics Conference - COCOON'98, 1998, Taipei/Taiwan, pp.194-203. ⟨inria-00098615⟩



Record views