We stand with Ukraine  

Reiner Czerwinski

According to our database1, Reiner Czerwinski authored at least 7 papers between 2007 and 2024.

Collaborative distances:
  • no known Dijkstra number2.
  • no known Erdős number3.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2024
The Polynomial Hierarchy does not collapse.
[BibTeX]
[DOI]
Reiner Czerwinski
CoRR, 2024

2023
NP-hard problems are not in BQP.
[BibTeX]
[DOI]
Reiner Czerwinski
CoRR, 2023

L is unequal NL under the Strong Exponential Time Hypothesis.
[BibTeX]
[DOI]
Reiner Czerwinski
CoRR, 2023

P≠NP relative to a P-complete oracle.
[BibTeX]
[DOI]
Reiner Czerwinski
CoRR, 2023

2022
Incomplete sets in P for logspace-reduction.
[BibTeX]
[DOI]
Reiner Czerwinski
CoRR, 2022

2021
Separation of P and NP.
[BibTeX]
[DOI]
Reiner Czerwinski
CoRR, 2021

2007
A Polynomial Time Algorithm for Graph Isomorphism
[BibTeX]
[DOI]
Reiner Czerwinski
CoRR, 2007


  Loading...