Work

Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump $$_{n,\ell }$$

Year: 2015

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/978-3-319-16468-7_18

Authors: Maxim Buzdalov, Mikhail Kever, Benjamin Doerr

Institutions: ITMO University, École Polytechnique, Laboratoire d'Informatique de l'École Polytechnique

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2148808689

FWCI: 0.903

Cites: 7

Cited by: 4

Related to: 10