| Title: | Set graphs. II. Complexity of set graph recognition and similar problems |
|---|
| Authors: | ID Milanič, Martin (Author)
ID Rizzi, Romeo (Author)
ID Tomescu, Alexandru I. (Author) |
|---|
| Files: |  http://dx.doi.org/10.1016/j.tcs.2014.06.017
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | IAM - Andrej Marušič Institute
|
|---|
| Keywords: | acyclic orientation, extensionality, set graphs, NP-complete problem, #P-complete problem, hyper-extensional digraphs, separating code, open-out-separating code |
|---|
| Year of publishing: | 2014 |
|---|
| Number of pages: | str. 70-81 |
|---|
| Numbering: | Vol. 547 |
|---|
| PID: | 20.500.12556/RUP-7764  |
|---|
| ISSN: | 0304-3975 |
|---|
| UDC: | 519.17 |
|---|
| DOI: | 10.1016/j.tcs.2014.06.017 |
|---|
| COBISS.SI-ID: | 1537143492 |
|---|
| Publication date in RUP: | 03.04.2017 |
|---|
| Views: | 2290 |
|---|
| Downloads: | 131 |
|---|
| Metadata: |     |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
