On the complexity of non-unique probe selection
From MaRDI portal
Publication:2474080
DOI10.1016/j.tcs.2007.10.014zbMath1134.68025OpenAlexW2063037290MaRDI QIDQ2474080
Yongxi Cheng, Weili Wu, Ker-I. Ko
Publication date: 5 March 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.014
Related Items
DP-Complete Problems Derived from Extremal NP-Complete Properties ⋮ In Memoriam: Ker-I Ko (1950–2018)
Uses Software
Cites Work