pith. sign in

arxiv: 1007.4257 · v4 · pith:A2X5SOB4new · submitted 2010-07-24 · 💻 cs.CC · math.CO

Polynomial-time approximation scheme for Max-Cut problem

classification 💻 cs.CC math.CO
keywords communityapologizeapproximationconvincedcrackpotcrankdisturbingmax-cut
0
0 comments X
read the original abstract

The community convinced me that this peace of crank was written by crackpot trisector. I apologize for disturbing community.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.