arXiv
Open Access
2018
Non-Interlaced SAT is in P
Dr Serge Burckel
Abstrak
We investigate the NP-Complete problem SAT and the geometry of its instances. For a particular type that we call {\it non-interlaced formulas}, we propose a polynomial time algorithm for their resolution using graphs and matrices.
Topik & Kata Kunci
Penulis (1)
D
Dr Serge Burckel
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2018
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓