Simple Algorithms to Solve MAX-SAT and TSP

<p>We present the solution to two classical problems like MAX-SAT, or its 3-SAT partial case, and TSP from computational complexity theory using subset construction.</p>

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-01-01
DOI
https://doi.org/10.13140/rg.2.2.32131.82727
Primary Topic
Soybean genetics and cultivation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Simple Algorithms to Solve MAX-SAT and TSP

Zenodo (CERN European Organization for Nuclear Research)
Soybean genetics and cultivation
article

Simple Algorithms to Solve MAX-SAT and TSP

article en

Abstract

<p>We present the solution to two classical problems like MAX-SAT, or its 3-SAT partial case, and TSP from computational complexity theory using subset construction.</p>

Zenodo (CERN European Organization for Nuclear Research)
Industry, innovation and infrastructure
Openalex Percentile: Top 39%
Soybean genetics and cultivation
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.

Simple Algorithms to Solve MAX-SAT and TSP · Zenodo (CERN European Organization for Nuclear Research) (2025) | TGRS Research Map | TGRS