From

Institution

Field

Type

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

Reset

Papers matching “polynomial complexity” 174

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
2022 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Benedikt Pago

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
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
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
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem
2025 Journal of Computer and System Sciences article Computer Science Advanced Graph Theory Research Open access

Hans L. Bodlaender, Matthew Johnson, Barnaby D. Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, +2 more

0

citations
Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
2023 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

0

citations
Insights into the computational complexity of the single-source capacitated facility location problem with customer preferences
2026 Annals of Operations Research article Business, Management and Accounting Facility Location and Emergency Management Open access

Christina Büsing, Timo Gersing, Sophia Wrede

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

1

citations
The Complexity Classes of Hamming Distance Recoverable Robust Problems
2022 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne

1

citations
The Complexity of Stackelberg Pricing Games
2025 IT University Of Copenhagen (IT University of Copenhagen) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Dorothee Henke, Eva Rotenberg, Lasse Wulf

0

citations
Multilevel weighted least squares polynomial approximation
2020 ESAIM Mathematical Modelling and Numerical Analysis article Mathematics Mathematical Approximation and Integration Open access

Abdul-Lateef Haji-Ali, Fabio Nobile, Raul F. Tempone

11

citations
Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms
2024 Discrete Applied Mathematics article Engineering Scheduling and Optimization Algorithms Open access

Mariia Anapolska, Tabea Brandt, Christina Büsing, Tobias Mömke

0

citations
Computing High-Degree Polynomial Gradients in Memory
2024 arXiv (Cornell University) preprint Engineering Advanced Memory and Neural Computing Open access

George Hutchinson, Giacomo Pedretti, Xia Sheng, Jim Ignowski, Thomas Van Vaerenbergh, Raymond G. Beausoleil, +2 more

1

citations
Characterizing Trainability of Instantaneous Quantum Polynomial Circuit Born Machines
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Kevin Shen, Susanne Pielawa, Vedran Dunjko, Hao Wang

0

citations
Computational complexity of graph orientation, bilevel and robust optimization problems
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Advanced Graph Theory Research Open access

Komal Muluk

0

citations
Polynomial Loops: Beyond Termination
2020 EPiC series in computing conference-paper Computer Science Logic, programming, and type systems Open access

Marcel Hark, Florian Frohn, Jürgen Giesl

13

citations
Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Benedikt Pago

1

citations
Thermodynamic Perspectives on Computational Complexity: Exploring the P vs. NP Problem
2023 SSRN Electronic Journal preprint Computer Science Complexity and Algorithms in Graphs Open access

Florian Neukart

2

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
A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
2026 Leibniz international proceedings in informatics book-chapter Computer Science Advanced Graph Theory Research Open access

Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi

0

citations
Polynomial pathwidth for graphs vertex-coverable by few shortest paths and algorithms for quasi-shortest path covers
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Li-Hsuan Chen, Florent Foucaud, Ling-Ju Hung, Ralf Klasing, Lucas Lorieau, Peter Rossmanith

0

citations
The Complexity of Homomorphism Reconstruction Revisited
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

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

0

citations
A Finite-Model-Theoretic View on Propositional Proof Complexity
2022 Logical Methods in Computer Science article Computer Science Complexity and Algorithms in Graphs Open access

Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa

5

citations
Computational Complexity of the Weisfeiler-Leman Dimension
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Simon Raßmann, Pascal Schweitzer

2

citations
Computational Complexity of the Weisfeiler-Leman Dimension
2024 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Moritz Lichter, Simon Raßmann, Pascal Schweitzer

0

citations