"Complexity of cover-preserving embeddings of bipartite orders into Boolean ..."

Grzegorz Herman (2014)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2021-12-08

- view
  - electronic edition @ uj.edu.pl (open access)
- export record
  dblp key:
  - journals/rml/Herman14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rml/Herman14
Grzegorz Herman:
Complexity of cover-preserving embeddings of bipartite orders into Boolean lattices. Reports Math. Log. 49: 99-117 (2014)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.