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

scientific article; zbMATH DE number 1554930

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

zbMath0953.06005MaRDI QIDQ4525259

No author found.

Publication date: 21 January 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics of partially ordered sets (06A07)


Related Items (7)

On building the transitive reduction of a two-dimensional poset ⋮ Computing a poset from its realizer ⋮ The complexity of embedding orders into small products of chains ⋮ The Hardness of Approximating Poset Dimension ⋮ The Complexity of the Partial Order Dimension Problem: Closing the Gap ⋮ A compact data structure and parallel algorithms for permutation graphs ⋮ The computational complexity of rationalizing Pareto optimal choice behavior




This page was built for publication:

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