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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+The Complexity of Computing Minimal Unidirectional Covering Sets
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 5713750
@@ Property / DOI @@
-.1007/s00224-012-9437-9
@@ Property / DOI: 10.1007/s00224-012-9437-9 / rank @@
-Normal rank
@@ Property / title @@
+The Complexity of Computing Minimal Unidirectional Covering Sets (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68288
@@ Property / zbMATH Open document ID: 1284.68288 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-13073-1_27
@@ Property / DOI: 10.1007/978-3-642-13073-1_27 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00224-012-9437-9
@@ Property / DOI: 10.1007/S00224-012-9437-9 / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+May 2010Timestamp +2010-05-28T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2010-05-28T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 28 May 2010 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5713750
@@ Property / zbMATH DE Number: 5713750 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3106147620
@@ Property / OpenAlex ID: W3106147620 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2083373291
@@ Property / OpenAlex ID: W2083373291 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.3692
@@ Property / arXiv ID: 0901.3692 / rank @@
+Normal rank
@@ Property / cites work @@
+Ranking Tournaments
@@ Property / cites work: Ranking Tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing minimal unidirectional covering sets
+Normal rank
@@ Property / cites work @@
+Q3266133
@@ Property / cites work: Q3266133 / rank @@
+Normal rank
@@ Property / cites work @@
+On the possibility of reasonable consistent majoritarian choice: Some positive results
+Normal rank
@@ Property / cites work @@
+Q3624140
@@ Property / cites work: Q3624140 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the minimal covering set
@@ Property / cites work: Computing the minimal covering set / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Choice Sets
@@ Property / cites work: The Computational Complexity of Choice Sets / rank @@
+Normal rank
@@ Property / cites work @@
+A computational analysis of the tournament equilibrium set
+Normal rank
@@ Property / cites work @@
+The Boolean Hierarchy I: Structural Properties
@@ Property / cites work: The Boolean Hierarchy I: Structural Properties / rank @@
+Normal rank
@@ Property / cites work @@
+The Boolean Hierarchy II: Applications
@@ Property / cites work: The Boolean Hierarchy II: Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Aspects of Cooperative Game Theory
@@ Property / cites work: Computational Aspects of Cooperative Game Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Exact analysis of Dodgson elections
@@ Property / cites work: Exact analysis of Dodgson elections / rank @@
+Normal rank
@@ Property / cites work @@
+Covering sets and a new Condorcet choice correspondence
+Normal rank
@@ Property / cites work @@
+Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
+Normal rank
@@ Property / cites work @@
+On the computational cost of disjunctive logic programming: Propositional case
+Normal rank
@@ Property / cites work @@
+The complexity class θp2: Recent results and applications in AI and modal logic
+Normal rank
@@ Property / cites work @@
+Condorcet Social Choice Functions
@@ Property / cites work: Condorcet Social Choice Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
+Normal rank
@@ Property / cites work @@
+Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP
+Normal rank
@@ Property / cites work @@
+Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
+Normal rank
@@ Property / cites work @@
+The complexity of Kemeny elections
@@ Property / cites work: The complexity of Kemeny elections / rank @@
+Normal rank
@@ Property / cites work @@
+The Minimization Problem for Boolean Formulas
@@ Property / cites work: The Minimization Problem for Boolean Formulas / rank @@
+Normal rank
@@ Property / cites work @@
+The difference and truth-table hierarchies for NP
@@ Property / cites work: The difference and truth-table hierarchies for NP / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of polynomial time reducibilities
@@ Property / cites work: A comparison of polynomial time reducibilities / rank @@
+Normal rank
@@ Property / cites work @@
+Tournament solutions and majority voting
@@ Property / cites work: Tournament solutions and majority voting / rank @@
+Normal rank
@@ Property / cites work @@
+The Proof That a Game May Not Have a Solution
@@ Property / cites work: The Proof That a Game May Not Have a Solution / rank @@
+Normal rank
@@ Property / cites work @@
+Q4369423
@@ Property / cites work: Q4369423 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5844986
@@ Property / cites work: Q5844986 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of facets (and some facets of complexity)
+Normal rank
@@ Property / cites work @@
+Q4743737
@@ Property / cites work: Q4743737 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity theory and cryptology. An introduction to cryptocomplexity.
+Normal rank
@@ Property / cites work @@
+Exact complexity of the winner problem for Young elections
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum equivalent DNF problem and shortest implicants
+Normal rank
@@ Property / cites work @@
+Relative complexity of checking and evaluating
@@ Property / cites work: Relative complexity of checking and evaluating / rank @@
+Normal rank
@@ Property / cites work @@
+More complicated questions about maxima and minima, and some closures of NP
+Normal rank
@@ Property / cites work @@
+Bounded Query Classes
@@ Property / cites work: Bounded Query Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Banks winners in tournaments are difficult to recognize
+Normal rank
@@ Property / cites work @@
+Extending Condorcet's rule
@@ Property / cites work: Extending Condorcet's rule / rank @@
+Normal rank

Latest revision as of 02:20, 28 December 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