ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2111.07059
  4. Cited By
Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic
  Programming
v1v2 (latest)

Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming

13 November 2021
J. Allcock
Yassine Hamoudi
A. Joux
Felix Klingelhöfer
M. Santha
ArXiv (abs)PDFHTML

Papers citing "Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming"

2 / 2 papers shown
Title
Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum:
  Modular Arithmetic Approach
Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach
Antoine Joux
Karol Węgrzycki
48
1
0
28 Aug 2024
Zero-Knowledge MIPs using Homomorphic Commitment Schemes
Zero-Knowledge MIPs using Homomorphic Commitment Schemes
Claude Crépeau
John Stuart
17
3
0
19 Apr 2023
1