From

Institution

Field

Type

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

Reset

Papers matching “polynomial complexity” 136

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Lower Bounds for Conjunctive and Disjunctive Turing Kernels
2021 RWTH Publications (RWTH Aachen) conference-paper Computer Science Advanced Graph Theory Research Open access

Elisabet Burjons, Peter Rossmanith

0

citations
Continuous facility location on graphs
2021 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger

6

citations
Learning properties of quantum states without the IID assumption
2024 Nature Communications article Computer Science Quantum Computing Algorithms and Architecture Open access

Omar Fawzi, Richard Kueng, Damian Markham, Aadil Oufkir

5

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
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, Timo Gersing, Corinna Mathwieser, Sabrina Schmitz, +1 more

0

citations
Computing subset vertex covers in H-free graphs
2025 Theoretical Computer Science article Computer Science Advanced Graph Theory Research Open access

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen

2

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

Scott Aaronson

0

citations
Limitations of measure-first protocols in quantum machine learning
2023 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Casper Gyurik, Riccardo Molteni, Vedran Dunjko

0

citations
Computing Subset Vertex Covers in $H$-Free Graphs
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma

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
From Wavefunction Regularity to Eigenvector Conditioning: Accuracy--Cost Trade-offs of Quantum Algorithms for Non-Hermitian Transcorrelated Hamiltonians
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Cheng-Lin Hong, Emiel Koridon, Paul K. Faehrmann, Thomas D. Kühne, Stefano Polla, Werner Dobrautz

0

citations
Sparse Random Hamiltonians Are Quantumly Easy
2024 Physical Review X article Computer Science Quantum Computing Algorithms and Architecture Open access cited by 1 patent

Chi-Fang Chen, Alexander M. Dalzell, Mario Berta, Fernando G. S. L. Brandão, Joel A. Tropp

7

citations
Calculating response functions of coupled oscillators using quantum phase estimation
2025 Physical Review Research article Computer Science Quantum Computing Algorithms and Architecture Open access

Sven Danz, Mario Berta, Stefan Schröder, Pascal Kienast, Frank K. Wilhelm, Alessandro Ciani

4

citations
Advanced statistical analysis of empirical performance scaling
2020 Genetic and Evolutionary Computation Conference (GECCO) conference-paper Computer Science Parallel Computing and Optimization Techniques

Yasha Pushak, Holger H. Hoos

2

citations
A Direct Reduction from Stochastic Parity Games to Simple Stochastic Games
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Formal Methods in Verification Open access

0

citations
Memory-centric architectures for energy-efficient cryptographic hardware in edge applications
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Cryptographic Implementations and Security Open access

Shutao Zhang

0

citations
Isomorphism, canonization, and definability for graphs of bounded rank width
2021 Communications of the ACM article Computer Science Advanced Graph Theory Research

Martin Grohe, Daniel Neuen

6

citations
Sample-efficient estimation of nonlinear quantum state functions
2026 Communications Physics article Computer Science Quantum Computing Algorithms and Architecture Open access

Hongshun Yao, Yingjian Liu, Tengxiang Lin, Xin Wang

2

citations
Recursive querying of neural networks via weighted structures
2026 arXiv (Cornell University) preprint Computer Science Logic, Reasoning, and Knowledge Open access

Martin Grohe, Christoph Standke, Juno Steegmans, Jan Van den Bussche

0

citations
Recursive querying of neural networks via weighted structures
2026 arXiv (Cornell University) preprint Computer Science Logic, Reasoning, and Knowledge Open access

Martin Grohe, Christoph Standke, Juno Steegmans, Jan Van den Bussche

0

citations
Parameter synthesis in Markov models
2020 RWTH Publications (RWTH Aachen) dissertation Computer Science Formal Methods in Verification Open access

Sebastian Junges

27

citations
Exploring Dimensionality Reduction Techniques for Efficient Surrogate-Assisted optimization
2020 IEEE Symposium Series on Computational Intelligence (SSCI) conference-paper Computer Science Advanced Multi-Objective Optimization Algorithms Open access

Sibghat Ullah, Duc Anh Nguyen, Hao Wang, Stefan Menzel, Bernhard Sendhoff, Thomas Bäck

17

citations
A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits
2026 Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

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

16

citations
A Faster Isomorphism Test for Graphs of Small Degree
2020 SIAM Journal on Computing article Computer Science Complexity and Algorithms in Graphs Open access

Martin Grohe, Daniel Neuen, Pascal Schweitzer

11

citations
A linear time algorithm for the robust recoverable selection problem
2020 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs Open access

Thomas Lachmann, Stefan Lendl, Gerhard J. Woeginger

9

citations