On the computational complexity of qualitative coalitional games (Q814613): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.artint.2004.04.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2029608926
@@ Property / OpenAlex ID: W2029608926 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4003461
@@ Property / cites work: Q4003461 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Based Algorithms for Boolean Function Manipulation
+Normal rank
@@ Property / cites work @@
+The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
+Normal rank
@@ Property / cites work @@
+Q3994882
@@ Property / cites work: Q3994882 / rank @@
+Normal rank
@@ Property / cites work @@
+Relations Among Complexity Measures
@@ Property / cites work: Relations Among Complexity Measures / rank @@
+Normal rank
@@ Property / cites work @@
+More on non-cooperation in dialogue logic
@@ Property / cites work: More on non-cooperation in dialogue logic / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q4385525
@@ Property / cites work: Q4385525 / rank @@
+Normal rank
@@ Property / cites work @@
+The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Method of determining lower bounds for the complexity of \(\Pi\)-circuits
+Normal rank
@@ Property / cites work @@
+Q3249579
@@ Property / cites work: Q3249579 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4305608
@@ Property / cites work: Q4305608 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3576736
@@ Property / cites work: Q3576736 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of facets (and some facets of complexity)
+Normal rank
@@ Property / cites work @@
+Q2756787
@@ Property / cites work: Q2756787 / rank @@
+Normal rank
@@ Property / cites work @@
+A Modal Logic for Coalitional Power in Games
@@ Property / cites work: A Modal Logic for Coalitional Power in Games / rank @@
+Normal rank
@@ Property / cites work @@
+Q3924096
@@ Property / cites work: Q3924096 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on monotone complexity of the logical permanent
+Normal rank
@@ Property / cites work @@
+Coalition structure generation with worst case guarantees
+Normal rank
@@ Property / cites work @@
+The network complexity and the Turing machine complexity of finite functions
+Normal rank
@@ Property / cites work @@
+Methods for task allocation via agent coalition formation
+Normal rank
@@ Property / cites work @@
+Q3198912
@@ Property / cites work: Q3198912 / rank @@
+Normal rank
@@ Property / cites work @@
+Complete sets and the polynomial-time hierarchy
@@ Property / cites work: Complete sets and the polynomial-time hierarchy / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:814613