COMPUTATIONAL COMPLEXITY OF DESIGN PROBLEM
نویسندگان
چکیده
منابع مشابه
Computational complexity of the quantum separability problem
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first systematic and comprehensive treatment of this (bipartite) quantum separability problem, focusing on its deterministic (as opposed to randomized) computationa...
متن کاملThe Computational Complexity of the Frobenius Problem
In this paper, as a main theorem, we prove that the decision version of the Frobenius problem is Σ2 -complete under Karp reductions. Given a finite set A of coprime positive integers, we call the greatest integer that cannot be represented as a nonnegative integer combination of A the Frobenius number, and we denote it as g(A). We call a problem of finding g(A) for a given A the Frobenius probl...
متن کاملThe Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we construct an agent that will successfully achieve the task in the environment? We refer to this problem as agent design. Using an abstract formal model of agents and their environments, we begin by investigating various pos...
متن کاملOn the Computational Complexity of Sequence Design
Inverse protein folding concerns the identification of an amino acid sequence that folds to a given structure. Sequence design problems attempt to avoid the apparant difficulty of inverse protein folding by defining an energy that can be minimized to find protein-like sequences. We evaluate the practical relevance of two sequence design problems by analyzing their computational complexity. Vc' ...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Architecture and Planning (Transactions of AIJ)
سال: 2013
ISSN: 1340-4210,1881-8161
DOI: 10.3130/aija.78.2657