A simplified NP-complete MAXSAT problem (Q293164)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A simplified NP-complete MAXSAT problem	scientific article

Statements

scholarly article

0 references

A simplified NP-complete MAXSAT problem (English)

0 references

zbMATH Open document ID

0 references

10.1016/S0020-0190(97)00223-8

0 references

Venkatesh Raman

0 references

S. Srinivasa Rao

0 references

0 references

Information Processing Letters

0 references

publication date

9 June 2016

0 references

full work available at URL

http://www.sciencedirect.com/science/article/pii/S0020019097002238?np=y

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

computational complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

Two-Processor Scheduling with Start-Times and Deadlines

0 references

Some simplified NP-complete graph problems

0 references

On the complexity of the maximum satisfiability problem for Horn formulas

0 references

The Minimum Satisfiability Problem

0 references

One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete

0 references

Solving satisfiability in less than \(2^ n\) steps

0 references

The Euclidean traveling salesman problem is NP-complete

0 references

0 references

A simplified NP-complete satisfiability problem

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:293164

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q293164&oldid=37299811"