I am reading the Handbook of Satisfiability and in the preface Martin Davis wrote Of course what is regarded as the most important problem in theoretical computer science, P = ? NP lives right here. It is remarkable that we still dont know whether or not there is a poly-time algorithm for SAT. I am in a tiny minority in being unconvinced that the answer must be No. I surely dont expect anyone to find a really efficient uniform algorithm for SAT. But I find the heuristic arguments against the existence of a very inefficient algorithm for SAT that happens to run in poly-time quite unconvincing.The part in bold I do not understand, Could you help me to desccribe who are the heuristic arguments against the existence of a very inefficient algorithm for SAT that happens to run in poly-time?
Heuristic Arguments against Existence of very inefficient alogirthm for SAT
satisfiability