From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “computational hardness” 136

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

The Complexity Classes of Hamming Distance Recoverable Robust Problems
2024 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs

Christoph Grüne

1

citations
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem
2025 Journal of Computer and System Sciences article Computer Science Complexity and Algorithms in Graphs Open access

0

citations
The Complexity of Homomorphism Reconstruction Revisited
2026 Leibniz international proceedings in informatics book-chapter Computer Science Complexity and Algorithms in Graphs Open access

Timo Gervens, Martin Grohe, Louis Härtel, Philipp Silva da Fonseca

0

citations
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

0

citations
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
2024 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

0

citations
The complexity of blocking all solutions
2026 Theoretical Computer Science article Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

0

citations
Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting
2020 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Toni Böhnlein, Stefan Kratsch, Oliver Schaudt

11

citations
Fare Zone Assignment on Trees
2025 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Martin Hoefer, Lennart Kauther, Philipp Pabst, Britta Peis, Khai Van Tran

0

citations
The Complexity of Homomorphism Reconstructibility
2025 ACM Transactions on Computation Theory article Computer Science Advanced Graph Theory Research Open access

Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke

0

citations
Exponential separations between classical and quantum learners
2023 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Casper Gyurik, Vedran Dunjko

7

citations
Probabilistic Query Evaluation with Bag Semantics
2022 arXiv (Cornell University) preprint Computer Science Advanced Database Systems and Queries Open access

Martin Grohe, Peter Lindner, Christoph Standke

1

citations
Provable Quantum Speedups for Computing Persistence in Topological Data Analysis
2026 PRX Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Casper Gyurik, Alexander Schmidhuber, Robbie King, Vedran Dunjko

2

citations
Stochastic Games with Lexicographic Reachability-Safety Objectives
2020 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Krishnendu Chatterjee, Joost-Pieter Katoen, Maximilian Weininger, Tobias Winkler

20

citations
Exact Separation of Forbidden-Set Cuts Associated With Redundant Parity Checks of Binary Linear Codes
2020 IEEE Communications Letters article Computer Science Coding theory and cryptography Open access

Christian Puchert, Andreas M. Tillmann

2

citations
Robust two-dose vaccination schemes and the directed b -matching problem
2024 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs Open access

Jenny Segschneider, Arie M. C. A. Koster

1

citations
Faster Inference of Cell Complexes from Flows via Matrix Factorization
2025 European Signal Processing Conference (EUSIPCO) conference-paper Computer Science Topological and Geometric Data Analysis

Til Spreuer, Josef Hoppe, Michael T. Schaub

0

citations
The Solidarity Cover Problem
2023 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Eran Rosenbluth

0

citations
Faster Inference of Cell Complexes from Flows via Matrix Factorization
2025 arXiv (Cornell University) preprint Computer Science Topological and Geometric Data Analysis Open access

Til Spreuer, Josef Hoppe, Michael T. Schaub

0

citations
Parametrized Quantum Policies for Reinforcement Learning
2021 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Sofiène Jerbi, Casper Gyurik, Hans J. Briegel, Vedran Dunjko

10

citations
Stochastic games with lexicographic objectives
2023 Formal Methods in System Design article Computer Science Formal Methods in Verification Open access

Krishnendu Chatterjee, Joost-Pieter Katoen, Stefanie Mohr, Maximilian Weininger, Tobias Winkler

5

citations
Comparative Analysis of Indicators for Multi-objective Diversity Optimization
2025 Lecture notes in computer science conference-paper Computer Science Advanced Multi-Objective Optimization Algorithms Open access

Ksenia Pereverdieva, Andre H. Deutz, Tessa Ezendam, Thomas Bäck, Hèrm Hofmeyer, Michael Emmerich

4

citations
A Comprehensive Study of Residual CNNS for Acoustic Modeling in ASR
2020 IEEE International Conference on Acoustics Speech and Signal Processing conference-paper Computer Science Speech Recognition and Synthesis

Vitalii Bozheniuk, Albert Zeyer, Ralf Schlüter, Hermann Ney

3

citations
Compilation of product-formula Hamiltonian simulation via reinforcement learning
2023 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Lea M. Trenkwalder, Eleanor Scerri, Thomas E. O’Brien, Vedran Dunjko

1

citations
Comparative Analysis of Indicators for Multiobjective Diversity Optimization
2024 arXiv (Cornell University) preprint Computer Science Advanced Multi-Objective Optimization Algorithms Open access

Ksenia Pereverdieva, Andre H. Deutz, Tessa Ezendam, Thomas Bäck, Hèrm Hofmeyer, Michael Emmerich

0

citations
The 2-Attractor Problem is NP-Complete
2023 arXiv (Cornell University) preprint Computer Science Algorithms and Data Compression Open access

Janosch Fuchs

0

citations