Complete problems for monotone NP (Q673092)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Complete problems for monotone NP	scientific article

Statements

scholarly article

0 references

Complete problems for monotone NP (English)

0 references

Iain A. Stewart

0 references

Theoretical Computer Science

0 references

publication date

28 February 1997

0 references

zbMATH Keywords

monotone NP

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

0 references

0 references

Languages that Capture Complexity Classes

0 references

The NP-completeness column: an ongoing guide

0 references

A complexity theory based on Boolean algebra

0 references

Comparing the Expressibility of Languages Formed Using NP-Complete Operators

0 references

Using the Hamiltonian path operator to capture NP

0 references

Methods for proving completeness via logical reductions

0 references

On completeness for NP via projection translations

0 references

Deciding whether a planar graph has a cubic subgraph is NP-complete

0 references

Logical Description of Monotone NP Problems

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0304-3975(94)00175-I

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:673092

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