Finding finite B2-sequences faster
Mathematics of Computation
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Theoretical Computer Science
Genetic Algorithm Approach to the Search for Golomb Rulers
Proceedings of the 6th International Conference on Genetic Algorithms
On the turnpike problem
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Optimal recovery schemes in fault tolerant distributed computing
Acta Informatica
Equivalence of some LP-based lower bounds for the Golomb ruler problem
Discrete Applied Mathematics
Some necessary clarifications about the chords' problem and the partial digest problem
Theoretical Computer Science
Partial digest is hard to solve for erroneous input data
Theoretical Computer Science
A class of binary recurrent codes with limited error propagation
IEEE Transactions on Information Theory
Exploiting a hypergraph model for finding golomb rulers
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.04 |
A Golomb Ruler is a ruler with integer marks where the distances between every two marks are distinct. Golomb Rulers find diverse applications in computer science and electrical engineering. According to our knowledge the computational complexity of problems related to the construction of Golomb Rulers is unknown. We provide natural definitions for problems related to the construction of such rulers. The main contribution of this work is NP-completeness results for two such decision problems.