From

Institution

Field

Type

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

Reset

Papers matching “linear computational complexity” 203

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
A multi-vector interface quasi-Newton method with linear complexity for partitioned fluid–structure interaction
2020 Computer Methods in Applied Mechanics and Engineering article Engineering Advanced Numerical Methods in Computational Mathematics Open access

Thomas Spenke, Norbert Hosters, Marek Behr

32

citations
Design optimization of multi-energy systems using mixed-integer linear programming: Which model complexity and level of detail is sufficient?
2021 Energy Conversion and Management article Engineering Integrated Energy Systems Optimization

Marco Wirtz, Dirk Müller

100

citations
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Nils Lommen, Fabian Meyer, Jürgen Giesl

7

citations
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
2022 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

1

citations
Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (Short WST Version)
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

0

citations
Subcarrier Grouping with Linear Time-Domain Compensation for Low-Complexity Millimeter Wave OFDM Multiuser Systems
2021 2021 IEEE 94th Vehicular Technology Conference (VTC2021-Fall) conference-paper Engineering Millimeter-Wave Propagation and Modeling

Zekai Liang, Gerd Ascheid

0

citations
A Flexible Framework for Expectation Maximization-Based MIMO System Identification for Time-Variant Linear Acoustic Systems
2023 IEEE Open Journal of Signal Processing article Engineering Advanced Adaptive Filtering Techniques Open access

Tobias Kabzinski, Peter Jax

3

citations
An Analysis of the Decidability and Complexity of Numeric Additive Planning
2024 Proceedings of the International Conference on Automated Planning and Scheduling conference-paper Computer Science Logic, Reasoning, and Knowledge Open access

Hayyan Helal, Gerhard Lakemeyer

1

citations
Bipartite $q$-Kneser graphs and two-generated irreducible linear groups
2023 arXiv (Cornell University) preprint Mathematics Finite Group Theory Research Open access

S. P. Glasby, Alice C. Niemeyer, Cheryl E. Praeger

0

citations
An integral equation formulation of the N-body dielectric spheres problem. Part II: complexity analysis
2020 ESAIM Mathematical Modelling and Numerical Analysis article Physics and Astronomy Electromagnetic Scattering and Analysis Open access

Bérenger Bramas, Muhammad Hassan, Benjamin Stamm

7

citations
A modeler's guide to handle complexity in energy systems optimization
2021 Advances in Applied Energy article Engineering Integrated Energy Systems Optimization Open access

Leander Kotzur, Lars Nolting, Maximilian Hoffmann, Theresa Groß, Andreas Smolenko, Jan Priesmann, +7 more

200

citations
Constructive Recognition of Special Linear Groups
2024 arXiv (Cornell University) preprint Mathematics Finite Group Theory Research Open access

Max Horn, Alice Niemeyer, Cheryl E. Praeger, Daniel Rademacher

0

citations
Cylindrical algebraic decomposition based methods in satisfiability modulo non-linear real arithmetic
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Polynomial and algebraic computation Open access

0

citations
First-Order Model-Checking in Random Graphs and Complex Networks
2020 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Jan Dreier, Philipp Kuinke, Peter Rossmanith

1

citations
First-Order Model-Checking in Random Graphs and Complex Networks
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Philipp Kuinke, Peter Rossmanith

1

citations
Compute-Efficient Medical Image Classification with Softmax-Free Transformers and Sequence Normalization
2024 arXiv (Cornell University) preprint Neuroscience Brain Tumor Detection and Classification Open access

Firas Khader, Omar S. M. El Nahhas, Tianyu Han, Gustav Anton Müller‐Franzes, Sven Nebelung, Jakob Nikolas Kather, +1 more

0

citations
Structural risk minimization for quantum linear classifiers
2023 Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Casper Gyurik, van Dyon Vreumingen, Vedran Dunjko

34

citations
The complexity of the timetable‐based railway network design problem
2023 Networks article Social Sciences Transportation Planning and Optimization Open access

Nadine Friesen, Tim Sander, Christina Büsing, Karl Nachtigall, Nils Nießen

3

citations
The Descriptive Complexity of Graph Neural Networks
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Machine Learning and Algorithms Open access

Martin Grohe

4

citations
The Descriptive Complexity of Graph Neural Networks
2024 TheoretiCS article Computer Science Neural Networks and Applications Open access

Martin Grohe

3

citations
Computing f‐divergences and distances of high‐dimensional probability density functions
2022 Numerical Linear Algebra with Applications article Mathematics Tensor decomposition and applications Open access

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

5

citations
The Descriptive Complexity of Graph Neural Networks
2023 conference-paper Computer Science Advanced Graph Neural Networks

Martin Grohe

7

citations
Quantum aspects of chaos and complexity from bouncing cosmology: A study with two-mode single field squeezed state formalism
2021 SciPost Physics Core article Physics and Astronomy Quantum chaos and dynamical systems Open access

34

citations