Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the minimum satisfiability problem

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

DOI10.1007/978-3-030-39219-2_23zbMath1453.68115OpenAlexW3000966481MaRDI QIDQ779212

Umair Arif, Robert Benkoczi, Daya Ram Gaur, Ramesh Krishnamurti

Publication date: 21 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39219-2_23


zbMATH Keywords

approximation algorithmprimal-dual algorithmminimum satisfiability


Mathematics Subject Classification ID

Approximation algorithms (68W25) Computational aspects of satisfiability (68R07)


Related Items (1)

Revisiting maximum satisfiability and related problems in data streams




This page was built for publication: On the minimum satisfiability problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:779212&oldid=12708286"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 12:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki