On the Counting Version of the Maximum 2-Satisfiability Problem

The counting version of the maximum 2-satisfiability problem is considered. A parsimonious reduction of the satisfiability problem to the maximum 2-satisfiability problem is constructed, proving the computational hardness of the counting version of the maximum 2-satisfiability problem.

Authors

Institutions

Publication Details

Journal
Mathematical Notes
Published
2025-10-01
DOI
https://doi.org/10.1134/s0001434625605039
Primary Topic
Complexity and Algorithms in Graphs
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the Counting Version of the Maximum 2-Satisfiability Problem

V. Yu. Popov
Mathematical Notes
Complexity and Algorithms in Graphs
article

On the Counting Version of the Maximum 2-Satisfiability Problem

V. Yu. Popov
article en

Abstract

The counting version of the maximum 2-satisfiability problem is considered. A parsimonious reduction of the satisfiability problem to the maximum 2-satisfiability problem is constructed, proving the computational hardness of the counting version of the maximum 2-satisfiability problem.

Mathematical NotesVol. 118(3-4)
Ural Federal University (RU)
Openalex Percentile: Top 28%
Complexity and Algorithms in Graphs
DOISourceOpenAlex
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.

On the Counting Version of the Maximum 2-Satisfiability Problem — V. Yu. Popov · Mathematical Notes (2025) | TGRS Research Map | TGRS