arXiv Open Access 2011

The 3-satisfiability problem

Amar Mukherjee
Lihat Sumber

Abstrak

We present a deterministic polynomial-time algorithm that solves the 3-satisfiability problem.

Topik & Kata Kunci

Penulis (1)

A

Amar Mukherjee

Format Sitasi

Mukherjee, A. (2011). The 3-satisfiability problem. https://arxiv.org/abs/1104.4490

Akses Cepat

Lihat di Sumber
Informasi Jurnal
Tahun Terbit
2011
Bahasa
en
Sumber Database
arXiv
Akses
Open Access ✓