activity
20072024
most citedA Polynomial Time Algorithm for Graph Isomorphism

7 citations · 7 across the 8 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

cs.CC2021

Separation of P and NP

Reiner Czerwinski

There have been many attempts to solve the P versus NP problem. However, with a new proof method, P not equal NP can be proved. A time limit is set for an arbitrary Turing machine…

cs.CC2021

Separation of PSPACE and EXP

Reiner Czerwinski

This article shows that PSPACE not equal EXP. A simple but novel proof technique has been used to separate these two classes. Whether an arbitrary Turing machine accepts an input w…