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. 2305.00472
  4. Cited By
Efficient MILP Decomposition in Quantum Computing for ReLU Network
  Robustness

Efficient MILP Decomposition in Quantum Computing for ReLU Network Robustness

30 April 2023
Nicola Franco
Thomas Wollschläger
Benedikt Poggel
Stephan Günnemann
J. Lorenz
ArXivPDFHTML

Papers citing "Efficient MILP Decomposition in Quantum Computing for ReLU Network Robustness"

3 / 3 papers shown
Title
Certifiably Robust Encoding Schemes
Certifiably Robust Encoding Schemes
Aman Saxena
Tom Wollschlager
Nicola Franco
J. M. Lorenz
Stephan Günnemann
OOD
AAML
40
1
0
02 Aug 2024
Discrete Randomized Smoothing Meets Quantum Computing
Discrete Randomized Smoothing Meets Quantum Computing
Md. Nazmus Sakib
Aman Saxena
Nicola Franco
Md Mashrur Arifin
Stephan Günnemann
AAML
29
1
0
01 Aug 2024
Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks
Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks
Guy Katz
Clark W. Barrett
D. Dill
Kyle D. Julian
Mykel Kochenderfer
AAML
231
1,837
0
03 Feb 2017
1