From

Institution

Field

Type

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

Reset

Papers matching “polynomial complexity” 52

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
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
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
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
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
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
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
Computational Complexity of Alignments
2026 arXiv (Cornell University) preprint Business, Management and Accounting Business Process Modeling and Analysis Open access

Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst

1

citations
Comparing intrusive and non-intrusive polynomial chaos for a class of exponential time differencing schemes
2023 arXiv (Cornell University) preprint Mathematics Numerical methods for differential equations Open access

Julian Clausnitzer, Andreas Kleefeld

0

citations
The Complexity of Reachability in Parametric Markov Decision Processes
2020 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Sebastian Junges, Joost-Pieter Katoen, Guillermo A. Pérez, Tobias Winkler

10

citations
Parameterized Complexity of Scheduling Unit-TimeJobs with Generalized Precedence Constraints
2025 arXiv (Cornell University) preprint Engineering Scheduling and Optimization Algorithms Open access

Christina Büsing, Maurice Draeger, Corinna Mathwieser

0

citations
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
Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
2026 arXiv (Cornell University) preprint Computer Science Petri Nets in System Modeling Open access

Thomas M. Prinz, Christopher T. Schwanen, Wil M. P. van der Aalst

0

citations
Randomized least-squares with minimal oversampling and interpolation in general spaces
2023 arXiv (Cornell University) preprint Mathematics Mathematical Approximation and Integration Open access

Abdellah Chkifa, Matthieu Dolbeault

1

citations
Computing f-Divergences and Distances of High-Dimensional Probability Density Functions -- Low-Rank Tensor Approximations
2021 arXiv (Cornell University) preprint Mathematics Tensor decomposition and applications Open access

Alexander Litvinenko, Youssef Marzouk, Hermann Georg Matthies, Marco Scavino, Alessio Spantini

0

citations
Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Michael Emmerich, Ksenia Pereverdieva, Andre H. Deutz

0

citations
Robust Minimum Cost Flow Problem Under Consistent Flow Constraints
2020 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz

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
Exploiting Strict Constraints in the Cylindrical Algebraic Covering
2023 arXiv (Cornell University) preprint Computer Science Polynomial and algebraic computation Open access

Philipp Bär, Jasper Nalbach, Erika Ábrahám, Christopher W. Brown

1

citations
A Faster Parametric Search for the Integral Quickest Transshipment Problem
2025 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Mariia Anapolska, Dario van den Boom, Christina Büsing, Timo Gersing

0

citations