3SAT ≤p 2SAT

3SAT is not polynomially reductible to 2SAT. Hence in this writing, I do not try to prove it but work around it.

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-05-26
DOI
https://doi.org/10.5281/zenodo.15516883
Primary Topic
Constraint Satisfaction and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

3SAT ≤p 2SAT

Zenodo (CERN European Organization for Nuclear Research)
Constraint Satisfaction and Optimization
article

3SAT ≤p 2SAT

article en

Abstract

3SAT is not polynomially reductible to 2SAT. Hence in this writing, I do not try to prove it but work around it.

Zenodo (CERN European Organization for Nuclear Research)
Quality Education
Openalex Percentile: Top 49%
Constraint Satisfaction and Optimization
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

3SAT ≤p 2SAT · Zenodo (CERN European Organization for Nuclear Research) (2025) | TGRS Research Map | TGRS