Work

The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity

Year: 2011

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/978-3-642-22993-0_17

Author: Christina Boucher

Institution: University of California San Diego

Language: English

Topic: Algorithms and Data Compression

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

Funder: Mitacs

OpenAlex ID: W153100663

FWCI:

Cites: 38

Cited by:

Related to: 10