The complexity of computing minimal unidirectional covering sets (Q372959): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q3563011
aliases / en / 0aliases / en / 0
 
The Complexity of Computing Minimal Unidirectional Covering Sets
description / endescription / en
 
scientific article; zbMATH DE number 5713750
Property / title
 
The Complexity of Computing Minimal Unidirectional Covering Sets (English)
Property / title: The Complexity of Computing Minimal Unidirectional Covering Sets (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1284.68288 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-13073-1_27 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
28 May 2010
Timestamp+2010-05-28T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 28 May 2010 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5713750 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083373291 / rank
 
Normal rank

Revision as of 11:49, 29 April 2024

scientific article; zbMATH DE number 5713750
  • The Complexity of Computing Minimal Unidirectional Covering Sets
Language Label Description Also known as
English
The complexity of computing minimal unidirectional covering sets
scientific article; zbMATH DE number 5713750
  • The Complexity of Computing Minimal Unidirectional Covering Sets

Statements

The complexity of computing minimal unidirectional covering sets (English)
0 references
The Complexity of Computing Minimal Unidirectional Covering Sets (English)
0 references
0 references
0 references
0 references
0 references
0 references
21 October 2013
0 references
28 May 2010
0 references
computational social choice
0 references
computational complexity
0 references
minimal upward covering sets
0 references
minimal downward covering sets
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references