A Krausz partition of a graph G is a partition of the edges of G into complete subgraphs. The Krausz dimension of a graph G is the least number k such that G admits a Krausz partition in which each vertex belongs to a...
详细信息
In this paper we study the computational complexity of computing an evolutionary stable strategy (ESS) in multi-player symmetric games. For two-player games, deciding existence of an ESS is complete for Σ2p, the seco...
详细信息
The problem of Distance Edge Labeling is a variant of Distance Vertex Labeling (also known as L2,1labeling) that has been studied for more than twenty years and has many applications, such as frequency assignment. The...
详细信息
The ability to simulate complex physical situations in real-time is a critical element of any "virtual world" scenario, as well as being key for many engineering and robotics applications. Unfortunately the ...
详细信息
We analyze the computational complexity of optimally playing the two-player board game Push Fight, generalized to an arbitrary board and number of pieces. We prove that the game is PSPACE-hard to decide who will win f...
详细信息
In 1979, Hylland and Zeckhauser [23] gave a simple and general scheme for implementing a one-sided matching market using the power of a pricing mechanism. Their method has nice properties – it is incentive compatible...
详细信息
Planning is a very important AI problem, and it is also a very time-consuming AI problem. To get an idea of how complex different planning problems are, it is useful to describe the computational complexity of differe...
详细信息
This paper studies the structured singular value (μ) problem with real parameters bounded by an p norm. Our main result shows that this generalized μ problem is NP-hard for any given rational number p ∈ [1, ∞], wh...
详细信息
ISBN:
(纸本)9783952426906
This paper studies the structured singular value (μ) problem with real parameters bounded by an p norm. Our main result shows that this generalized μ problem is NP-hard for any given rational number p ∈ [1, ∞], whenever κ, the size of the smallest repeated block, exceeds 1. This result generalizes the known result that the conventional μ problem (with p = ∞) is NP-hard. However, our proof technique is different from the known proofs for the p = ∞ case as these proofs do not generalize to p ≠ ∞. For κ = 1 and p = ∞, the μ problem is known to be NP-hard. We provide an alternative proof of this result. For κ = 1 and p finite the issue of NP-hardness remains unresolved. When every block has size 1, and p = 2 we outline some potential difficulties in computing μ.
Evaluation of the frequency of occurrences of a given set of patterns in a DNA sequence has numerous applications and has been ex- tensively studied recently. We discuss the computational complexity for explicit formu...
详细信息
Herugolf and Makaro are Nikoli’s pencil puzzles. We study the computational complexity of Herugolf and Makaro puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete. ...
详细信息
暂无评论