Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On the parallel parameterized complexity of MaxSAT variants

From MaRDI portal
Publication:6572033
Jump to:navigation, search

DOI10.4230/LIPICS.SAT.2022.19MaRDI QIDQ6572033FDOQ6572033

Malte Skambath, Max Bannach, Till Tantau

Publication date: 12 July 2024






zbMATH Keywords

fixed-parameter tractabilityparallel algorithmsMaxSATalmost-SAT


Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07)



Cited In (1)

  • On the parallel parameterized complexity of MaxSAT variants





This page was built for publication: On the parallel parameterized complexity of MaxSAT variants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572033)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6572033&oldid=40107476"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 17:22. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki