From

Institution

Field

Type

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

Reset

Papers matching “polynomial approximation” 45

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Polynomial Time Quantum Approximation Schemes for Constrained Optimisation
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Chinonso Onah, Kristel F. L. Michielsen

0

citations
Approximation Algorithms for Discounted Graph Search with Norm Objectives
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Svenja M. Griesbach, Felix Hommelsheim, Max Klimm

0

citations
Approximation Algorithms for Discounted Graph Search with Norm Objectives
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Svenja M. Griesbach, Felix Hommelsheim, Max Klimm

0

citations
Improved Approximation Algorithms for the Expanding Search Problem
2026 SIAM Journal on Discrete Mathematics article Computer Science Complexity and Algorithms in Graphs

0

citations
Approximating fixed size quantum correlations in polynomial time
2025 arXiv (Cornell University) preprint Computer Science Quantum Information and Cryptography Open access

Julius A. Zeiss, Gereon Koßmann, Omar Fawzi, Mario Berta

0

citations
Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization
2025 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs

Christoph Grüne, Lasse Wulf

4

citations
Upper bounds and approximation results for the k -slow burning problem
2024 Discrete Applied Mathematics article Computer Science Advanced Graph Theory Research Open access

Michaela Hiller, Arie M. C. A. Koster, Philipp Pabst

1

citations
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
2021 Journal of the ACM article Computer Science Cryptography and Data Security Open access

Ronald Cramer, Léo Ducas, Benjamin Wesolowski

20

citations
Quantum State Preparation without Coherent Arithmetic
2026 Physical Review Letters article Computer Science Quantum Computing Algorithms and Architecture Open access

Sam McArdle, András Gilyén, Mario Berta

17

citations
Computational complexity of problems in robust, bilevel and online optimization
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Complexity and Algorithms in Graphs Open access

0

citations
Minimum color‐degree perfect b‐matchings
2020 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Mariia Anapolska, Christina Büsing, Martin Comis, Tabea Krabs

1

citations
Non-Preemptive Tree Packing
2022 Algorithmica article Computer Science Complexity and Algorithms in Graphs Open access

Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf

1

citations
Non-preemptive Tree Packing
2021 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs Open access

Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf

0

citations
Approximating $δ$-Dispersion
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Tom Janßen

0

citations
Minimum‐Peak‐Cost Flows Over Time
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Mariia Anapolska, Emma Ahrens, Christina Büsing, Felix Engelhardt, Timo Gersing, Corinna Mathwieser, +2 more

0

citations
Improved Separation Between Quantum and Classical Computers for Sampling and Functional Tasks
2024 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Simon C. Marshall, Scott Aaronson, Vedran Dunjko

0

citations
Improved Separation Between Quantum and Classical Computers for Sampling and Functional Tasks
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Quantum Computing Algorithms and Architecture Open access

0

citations
Reoptimization of parameterized problems
2022 Acta Informatica article Computer Science Advanced Graph Theory Research Open access

Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith

9

citations
Efficiently Approximating Attention Is Hard
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Lukas Haverbeck, Carmen Amo Alonso, Andrés Felipe Posada-Moreno, Sebastian Trimpe, Marco Pavone

0

citations
A greedy algorithm for the social golfer and the Oberwolfach problem
2021 European Journal of Operational Research article Computer Science Complexity and Algorithms in Graphs Open access

Daniel Schmand, Marc Schröder, Laura Vargas Koch

4

citations
Algebraic and Puiseux series solutions of systems of autonomous algebraic ODEs of dimension one in several variables
2022 Journal of Symbolic Computation article Computer Science Polynomial and algebraic computation Open access

José Cano, Sebastian Falkensteiner, Daniel Robertz, J. Rafael Sendra

1

citations
Quantum Computational Complexity of Matrix Functions
2024 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Santiago Cifuentes, Samson Wang, Thais de Lima Silva, Mario Berta, Leandro Aolita

0

citations
Quantum Computational Complexity of Matrix Functions
2026 PRX Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Santiago Cifuentes, Samson Wang, Thais de Lima Silva, Mario Berta, Leandro Aolita

0

citations
Delegated online search
2024 Artificial Intelligence article Computer Science Optimization and Search Problems Open access

Pirmin Braun, Niklas Hahn, Martin Hoefer, Conrad Schecker

1

citations
A Comprehensive Analysis of Quantum Clustering : Finding All the Potential Minima
2021 International Journal of Data Mining & Knowledge Management Process article Computer Science Advanced Clustering Algorithms Research Open access

Aude Maignan

3

citations