A Polynomial Time Algorithm for Graph Isomorphism - Reiner Czerwinski (CoRR, 2007)

Separation of P and NP. - Reiner Czerwinski (CoRR, 2021)

Incomplete sets in P for logspace-reduction. - Reiner Czerwinski (CoRR, 2022)

P≠NP relative to a P-complete oracle. - Reiner Czerwinski (CoRR, 2023)

L is unequal NL under the Strong Exponential Time Hypothesis. - Reiner Czerwinski (CoRR, 2023)

NP-hard problems are not in BQP. - Reiner Czerwinski (CoRR, 2023)

The Polynomial Hierarchy does not collapse. - Reiner Czerwinski (CoRR, 2024)