Publications tagged "Hardness"
Automation CPS Certification Complexity Analysis Constraint Systems Cryptography EasyCrypt Expectation Transformers Functional Programming Graph Rewriting Hardness Haskell Higher-Order ICC ICCT Imperative Imperative Programming Interpretations Invariance Layout-Randomization Memoization OCaml Path Orders Predicative Recursion Probabilistic Program Analysis Quantum Runtime Complexity Analysis Security Sized-Types TCT Term Rewriting Termination Types
2024
-
Martin Avanzini, Georg Moser, Romain Péchoux and Simon Perdrix. “On the Hardness of Analyzing Quantum Programs Quantitatively”. Programming Languages and Systems - 33rd European Symposium on Programming, ESOP 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part II, volume 14577 of Lecture Notes in Computer Science, pages 31–58, (2024). Springer.