Reducing the arity in unbiased black-box complexity - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2014

Dates and versions

hal-01086516 , version 1 (24-11-2014)

Identifiers

Cite

Benjamin Doerr, Carola Doerr. Reducing the arity in unbiased black-box complexity. Theoretical Computer Science, 2014, 545, pp.108-121. ⟨10.1016/j.tcs.2013.05.004⟩. ⟨hal-01086516⟩
63 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More