相关论文: On the Complexity of a Derivative Chess Problem

We study the domination number $\gamma(Q_n^3)$ of the three-dimensional $n \times n \times n$ queen graph. The main result is a stratified theorem computing, for each position type -- corner, edge, face, or interior -- the number of…

We establish that the subgame perfect equilibrium (SPE) threshold problem for mean-payoff games is NP-complete. While the SPE threshold problem was recently shown to be decidable (in doubly exponential time) and NP-hard, its exact worst…

We define and give results on the game NecklaceNim NN($n$,$k$) which is PathNim PN($n$,$k$) with an additional move allowed on the end vertices. This game arises as a sub-game in the context of solving CircularNim CN($n$,$k$) when $k-2$…

In this paper we discuss the first order partial differential equations resolved with any derivatives. At first, we transform the first order partial differential equation resolved with respect to a time derivative into a system of linear…

Immanants are polynomial functions of n by n matrices attached to irreducible characters of the symmetric group S_n, or equivalently to Young diagrams of size n. Immanants include determinants and permanents as extreme cases. Valiant proved…

We study computational problems arising from the iterated removal of weakly dominated actions in anonymous games. Our main result shows that it is NP-complete to decide whether an anonymous game with three actions can be solved via iterated…

The determination of the computational complexity of multi-agent pathfinding on directed graphs has been an open problem for many years. For undirected graphs, solvability can be decided in polynomial time, as has been shown already in the…

I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or Probabilistic…

We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…

In this paper we study the complexity of solving quadratic equations in the lamplighter group. We give a complete classification of cases (depending on genus and other characteristics of a given equation) when the problem is…

In this paper, we give a procedure for derivation of higher dimensional periodic recurrence equations(PREs) by nested structure of complex numbers.

It is well known that kernels in graphs are powerful and useful structures, for instance in the theory of games. However, a kernel does not always exist and Chv\'atal proved in 1973 that it is an NP-Complete problem to decide its existence.…

Starting from degree N solutions of a time dependent Schroedinger-like equation for classical orthogonal polynomials, a linear matrix equation describing perturbations around the N zeros of the polynomial is derived. The matrix has…

Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…

We introduce the idea that the P vs NP problem can have a finer structure. Given the NP complete problem of interest, the configurations space of the problem can be divided in (at least) two regions. In one region, polynomial algorithms to…

This paper is concerned with complexity theoretic aspects of a general formulation of quantum game theory that models strategic interactions among rational agents that process and exchange quantum information. In particular, we prove that…

We study k-dependence and half domination problems for king's graphs in dimension n (n>1). Various sharp bounds are provided and a few conjectures are formulated in the cases the estimates are not the best possible.

The behavior of any physical system is governed by its underlying dynamical equations. Much of physics is concerned with discovering these dynamical equations and understanding their consequences. In this work, we show that, remarkably,…

The problem of exponentiating derivations of quasi *-algebras is considered in view of applying it to the determination of the time evolution of a physical system. The particular case where observables constitute a proper CQ*-algebra is…

We study the computational complexity of the Buttons \& Scissors game and obtain sharp thresholds with respect to several parameters. Specifically we show that the game is NP-complete for $C = 2$ colors but polytime solvable for $C = 1$.…