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

NP-partitions over posets with an application to reducing the set of solutions of NP problems

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

DOI10.1007/s00224-004-1114-1zbMath1061.68076OpenAlexW2066096553MaRDI QIDQ1764425

Sven Kosub

Publication date: 24 February 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-004-1114-1



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)


Related Items (6)

Descending chains and antichains of the unary, linear, and monotone subfunction relations ⋮ Fine hierarchies via Priestley duality ⋮ On the homomorphism order of labeled posets ⋮ The Boolean hierarchy of NP-partitions ⋮ Labeled posets are universal ⋮ Complexity Issues for Preorders on Finite Labeled Forests






This page was built for publication: NP-partitions over posets with an application to reducing the set of solutions of NP problems

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