New research examines MAXSTP computational complexity

A new research paper published on arXiv explores the computational complexity of the Maximum Satisfiability of Simple Temporal Problems (MAXSTP). The study analyzes MAXSTP's parameterized complexity concerning instance scale, coefficient magnitude, and structural graph parameters like treewidth and vertex cover. The findings indicate that MAXSTP is generally harder to solve than optimizing qualitative CSPs, with fixed-parameter tractability achievable for certain parameter combinations. AI

RANK_REASON The cluster contains a single academic paper published on arXiv detailing computational complexity research. [lever_c_demoted from research: ic=1 ai=0.4]

Read on arXiv cs.AI →

• Allen's algebra
• arXiv
• CatalyzeX
• DagsHub
• Gotit.pub
• Hugging Face
• MAXSTP
• RCC-8
• ScienceCast
• Simple Temporal Problem
• Victor Lagerkvist

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →