Reducibility of 3CNF Formulas: Satisfiability vs Reducibility

Authors

Publication Details

Published
2025-10-02
DOI
https://doi.org/10.33774/coe-2025-cghl5
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Reducibility of 3CNF Formulas: Satisfiability vs Reducibility

Latif Salum
Formal Methods in Verification
article

Reducibility of 3CNF Formulas: Satisfiability vs Reducibility

Latif Salum
article en

Abstract

No abstract available for this paper.
Openalex Percentile: Top 71%
Formal Methods in Verification
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.

Reducibility of 3CNF Formulas: Satisfiability vs Reducibility — Latif Salum · (2025) | TGRS Research Map | TGRS