"On Guaranteeing Polynomially Bounded Search Tree Size."

David A. Cohen et al. (2011)

Details and statistics

DOI: 10.1007/978-3-642-23786-7_14

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics