On guaranteeing polynomially-bounded search tree size

Cohen, Dave, Cooper, Martin, Green, Martin J. and Marx, Daniel

(2011)

Cohen, Dave, Cooper, Martin, Green, Martin J. and Marx, Daniel (2011) On guaranteeing polynomially-bounded search tree size. CP2011

Our Full Text Deposits

Full text access: Open

Full text file - 289.98 KB

Full text file - 289.98 KB

Abstract

Information about this Version

This is a Submitted version
This version's date is: 2011
This item is not peer reviewed

Link to this Version

https://repository.royalholloway.ac.uk/items/5cf09bfa-c5ee-3f65-9b4c-2a5dd243024b/5/

Item TypeConference Item (Paper)
TitleOn guaranteeing polynomially-bounded search tree size
AuthorsCohen, Dave
Cooper, Martin
Green, Martin J.
Marx, Daniel
DepartmentsFaculty of Science\Computer Science

Identifiers

Deposited by Research Information System (atira) on 13-Sep-2013 in Royal Holloway Research Online.Last modified on 13-Sep-2013

Details