On the complexity of constructing Golomb rulers
type: Item
instance of: scholarly article
title: On the complexity of constructing Golomb rulers
zbMATH Open document ID: 1186.68221
author: Christophe Meyer
author: Periklis A. Papakonstantinou
published in: Discrete Applied Mathematics
publication date: 2009-06-30T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 5572555
zbMATH Keywords: Golomb ruler
zbMATH Keywords: finite B\(_2\) set
zbMATH Keywords: \(\mathbf {NP}\)-hardness
Wikidata QID: Q56083330
MaRDI profile type: Publication
full work available at URL: j.dam.2008.07.006
OpenAlex ID: W2080125678
cites work: PRIMES is in P
cites work: GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
cites work: Partial digest is hard to solve for erroneous input data
cites work: Q4500966
cites work: The chords' problem
cites work: Some necessary clarifications about the chords' problem and the partial digest problem
cites work: A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler
cites work: On sum sets of Sidon sets. I
cites work: Q5713307
cites work: Q4934418
cites work: Optimal recovery schemes in fault tolerant distributed computing
cites work: On the uniform distribution in residue classes of dense sets of integers with distinct sums
cites work: Finding finite 𝐵₂-sequences faster
cites work: Q5692717
cites work: Equivalence of some LP-based lower bounds for the Golomb ruler problem
cites work: The complexity of minimum difference cover
cites work: Q3221403
cites work: A class of binary recurrent codes with limited error propagation
DOI: 10.1016/J.DAM.2008.07.006
description: scientific article; zbMATH DE number 5572555