3SAT ≤p 2SAT
Year: 2025
Type: article
Abstract: 3SAT is not polynomially reductible to 2SAT. Hence in this writing, I do not try to prove it but work around it.
Author: BABAGBETO, Giovani
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6930588121
FWCI:
Cites:
Cited by:
Related to: