Corpus ID: 2298416

3-SAT Polynomial Solution of Knowledge Recognition Algorithm

@article{Han20103SATPS,
  title={3-SAT Polynomial Solution of Knowledge Recognition Algorithm},
  author={Xiaowen Han and David Zhu and Cuifeng Zhou},
  journal={ArXiv},
  year={2010},
  volume={abs/1009.3687}
}
  • Xiaowen Han, David Zhu, Cuifeng Zhou
  • Published 2010
  • Mathematics, Computer Science
  • ArXiv
  • This paper introduces a knowledge recognition algorithm (KRA) for solving the 3SAT problem in polynomial time. KRA learns member-class relations and retrieves information through deductive and reductive iterative reasoning. It applies the principle of Chinese COVA* (equivalent to a set of eight 3-variable conjunctive clauses) and eliminates the "OR" operation to solve 3-SAT problem. That is, KRA does not search the assignment directly. It recognizes the complements as rejections at each level… CONTINUE READING

    Topics from this paper

    References

    SHOWING 1-10 OF 11 REFERENCES
    Knowledge Recognition Algorithm enables P = NP
    • 1
    • PDF
    The P versus NP Problem
    • 142
    • PDF
    Reducibility among combinatorial problems" in complexity of computer computations
    • 946
    The P versus NP Problem
    • 68
    • PDF
    Reference
    • 2008
    • 2,948
    The P versus NP Problem " . Manuscript prepared for the Clay Mathematics Institute for the Millennium Prize Problems
    • The P versus NP Problem " . Manuscript prepared for the Clay Mathematics Institute for the Millennium Prize Problems
    • 2000
    Reducibility Among Combinatorial Problems
    • R. Karp
    • Computer Science
    • Complexity of Computer Computations
    • 1972
    • 4,095
    Explanation of binary arithmetic
    • Explanation of binary arithmetic
    • 1703