From

Institution

Field

Type

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

Reset

Papers matching “polynomial complexity” 8

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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
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

Jasper Nalbach

0

citations
Robust optimization and variants of the scheduling problem
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Complexity and Algorithms in Graphs Open access

Jenny Segschneider

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
Parameter synthesis in Markov models
2020 RWTH Publications (RWTH Aachen) dissertation Computer Science Formal Methods in Verification Open access

Sebastian Junges

27

citations
Precedence constraints in combinatorial optimization
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Advanced Graph Theory Research Open access

Corinna Mathwieser

0

citations
Automated reasoning and randomization in separation logic
2020 RWTH Publications (RWTH Aachen) dissertation Computer Science Logic, programming, and type systems Open access

Christoph Matheja

6

citations

8 results