Arvind, V. and Schuler, R. (2003) The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. International Symposium on Algorithms and Computation, 2906, 168-177.

has been cited by the following article:

• TITLE: Number in Mathematical Cryptography

  AUTHORS: Nathan Hamlin

  KEYWORDS: Number Theory, Quantum Computing, Public-Key Cryptography, Generalized Knapsack Code, Combinatorial Code

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.7 No.1, January 23, 2017

  ABSTRACT: With the challenge of quantum computing ahead, an analysis of number and representation adequate to the task is needed. Some clarifications on the combinatorial nature of representation are presented here; this is related to the foundations of digital representations of integers, and is thus also of interest in clarifying what numbers are and how they are used in pure and applied mathematics. The author hopes this work will help mathematicians and computer scientists better understand the nature of the Generalized Knapsack Code, a lattice-based code which the author believes to be particularly promising, and the use of number in computing in general.