activity
20232026
most citedRealistic Runtime Analysis for Quantum Simplex Computation

1 citations · 1 across the 3 of their papers we have counts for

collaborators

5 papers

cs.CV2026

Automatic ply-specific analyses of CFRP micrographs using shortest-path-based ply distinction

Jonas Naumann, Jonas P. Appels, Julius Biermann +3

We present an automated approach to distinguish between ply instances in semantic segmentation masks of high-resolution carbon-fiber reinforced polymer micrographs. Interpreting th…

cs.CL2025

IMProofBench: Benchmarking AI on Research-Level Mathematical Proof Generation

Johannes Schmitt, Gergely Bérczi, Jasper Dekoninck +57

As the mathematical capabilities of large language models (LLMs) improve, it becomes increasingly important to evaluate their performance on research-level tasks at the frontier of…

quant-ph2024

Revealing hidden physical nonclassicality with nonnegative polynomials

Ties-A. Ohst, Benjamin Yadin, Birte Ostermann +3

Understanding quantum phenomena which go beyond classical concepts is a focus of modern quantum physics. Here, we show how the theory of nonnegative polynomials emerging around Hil…

math.OC2024

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion

Sabrina C. L. Ammann, Birte Ostermann, Sebastian Stiller +1

The Traveling Salesman Problem (TSP) is one of the most extensively researched and widely applied combinatorial optimization problems. It is NP-hard even in the symmetric and metri…

quant-ph20231 cited

Realistic Runtime Analysis for Quantum Simplex Computation

Sabrina Ammann, Maximilian Hess, Debora Ramacciotti +10

In recent years, strong expectations have been raised for the possible power of quantum computing for solving difficult optimization problems, based on theoretical, asymptotic wors…