From

Institution

Field

Type

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

Reset

Papers matching “polynomial addition” 35

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
More is Less: Adding Polynomials for Faster Explanations in NLSAT
2025 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Valentin Promies, Jasper Nalbach, Erika Ábrahám

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
Hermitian and Unitary Almost-Companion Matrices of Polynomials on Demand
2023 Entropy article Computer Science Matrix Theory and Algorithms Open access

Liubov A. Markovich, Agostino Migliore, ANTONINO MESSINA

0

citations
Robust transshipment problem under consistent flow constraints
2022 RWTH Publications (RWTH Aachen) article Computer Science Complexity and Algorithms in Graphs Open access

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

0

citations
Robust transshipment problem under consistent flow constraints
2023 Networks article Computer Science Complexity and Algorithms in Graphs Open access

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

1

citations
Matroid bases with cardinality constraints on the intersection
2021 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Stefan Lendl, Britta Peis, Veerle Timmermans

9

citations
Robust minimum cost flow problem under consistent flow constraints
2021 Annals of Operations Research article Computer Science Complexity and Algorithms in Graphs Open access

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

10

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
On boundary conditions parametrized by analytic functions
2022 arXiv (Cornell University) preprint Computer Science Polynomial and algebraic computation Open access

Markus Lange‐Hegermann, Daniel Robertz

0

citations
A Machine Learning Approach to Benchmarking Social Debt
2026 IEEE Access article Computer Science Software Engineering Techniques and Practices Open access

Philipp M. Zähl, Leonie Schulte, Sabrina Cornelia Eimler, Mathias Eggert, Martin Wolf

0

citations
Higher-order finite elements for embedded simulation
2020 ACM Transactions on Graphics article Computer Science Computer Graphics and Visualization Techniques

Andreas Longva, Fabian Löschner, Tassilo Kugelstadt, José Antonio Fernández-Fernández, Jan Bender

21

citations
Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Chinonso Onah, Kristel F. L. Michielsen

0

citations
Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Chinonso Onah, Kristel F. L. Michielsen

0

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
QuantumSavory/QuantumClifford.jl: v0.11.0
2026 Zenodo (CERN European Organization for Nuclear Research) software Computer Science Quantum Computing Algorithms and Architecture Open access

Stefan Krastanov, Feroz Ahmed Mian, Zhongyi Ni, Kanyang Ying, Praveen Viswanathan, Shayan Pardis, +21 more

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
The Importance of Parameters in Ranking Functions
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Database Systems and Queries Open access

Christoph Standke, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld

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
Weighted programming: a programming paradigm for specifying mathematical models
2022 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Tobias Winkler

18

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

15

citations
Quantum-classical separations in shallow-circuit-based learning with and without noises
2024 Communications Physics article Computer Science Quantum Computing Algorithms and Architecture Open access

Zhihan Zhang, Weiyuan Gong, Weikang Li, Dong-Ling Deng

9

citations
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
2024 TheoretiCS article Computer Science Complexity and Algorithms in Graphs Open access

David E. Roberson, Tim Seppelt

2

citations
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Complexity and Algorithms in Graphs Open access

David E. Roberson, Tim Seppelt

1

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