Skip to content

It seems I have a short proof of P=NP - verfiy it #1

@vporton

Description

@vporton

I've produced a short and much elementary proof of P=NP (without an efficient algorithm presented). I sent it to a reputable CS journal and insofar there were no errors noticed by the editor. (However, I myself found several errors, that are already corrected in the attached file.)

You should check my proof.

p=np-merkle.pdf

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions