The Computational Complexity of a Problem
On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model
... reconciliation problem considers duplications and losses, those events are treated differently from duplications and losses in the DL and DTL models due to the introduction of explicit gene loci in the DLC ...the ...
12
Computational complexity theory
... Definition: The complexity class NP consists of all decision problems for which yes instances of the problem have witnesses checkable in polynomial time on a Turing machine. Examples[r] ...
9
3. Computational Complexity.
... tenth problem, deciding the solvability of polyno- mial equations in integers, and the problem of deciding whether or not a finitely presented group is trivial) – and the second consists of problems that ...
23
Computational Complexity: A Modern Approach
... This new focus on building system from basic problems via reductions enabled modern cryp- tography to achieve two seemingly contradictory goals. On the one hand these new schemes are much more secure— systems such as the ...
26
Computational Complexity and Tort Deterrence
... the problem of complex product design ...the problem is less about how much one spends on safety and more about which combination of safety measures one selects from a large but discrete set of ...the ...
26
On the Computational Complexity of the Domination Game
... Abstract. 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 ...
8
The Computational Complexity of Linear Optics
... for every oracle O that samples exactly from the output distribution of a given quantum circuit. The proof of Theorem 4.9 is easily seen to relativize. However, we do not know the situation with our approximate result, ...
110
Computational Complexity of Statistical Machine Translation
... covering problem and it remains to be seen whether some of the techniques devel- oped for covering algorithms are useful for finding good approximations to Viterbi ...
8
Computational Complexity in Two Level Morphology
... Taking the Kimmo system (Kart- tunen, 1983) for concreteness, it will be shown that the general problem of mapping between ]exical and surface forms in two-level[r] ...
7
Turing Machines and Understanding Computational Complexity
... Halting Problem Turing’s paper [11], and more so Kurt G¨odel’s paper [4], where such a result first appeared, are celebrated for showing that certain well-defined questions in the mathematical domain cannot be ...
9
Computational Complexity of Weighted Threshold Games
... the problem of deter- mining whether the core is empty is solvable in polynomial time, and that the nucleolus can be computed in polynomial time when the core is ...
6
The Computational Complexity of Integer Programming with Alternations
... This suggests that for the “long” first coordinate dimensions of Q, it is unlikely that there is a good way to triangulate Q\P which would allow to compute |E 1 (Q\P )| efficiently. To argue in the opposite direction, ...
18
Computational Complexity in Additive Hedonic Games
... the computational task seems to become less demanding since the input size of the problem is polynomial of n when additivity is ...of computational complexity ...
33
Invariant Theory, Tensors and Computational Complexity
... (a 1 b 2 + a 2 b 1 + a 3 b 4 − a 4 b 3 ) 2 + (a 1 b 3 − a 2 b 4 + a 3 b 1 + a 4 b 2 ) 2 + (a 1 b 4 + a 2 b 3 − a 3 b 2 + a 4 b 1 ) 2 These identities would of course take much longer for us to verify. The first happens ...
118
Epistemic virtues, metavirtues, and computational complexity
... of computational complexity that capture very general and universal features of how problem solving power can be more or less restricted, which we can use as part of a framework for articulating the ...
40
The computational complexity of approximation of partition functions
... a problem can be expressed as a combination of not too many smaller ...a problem to be encoded in an unusual way), we will now describe the argument for the particular case of Holant problems, illustrating ...
225
A Computable Economist’s Perspective on Computational Complexity
... of computational complexity theory would mean a retracing of the past from the vantage point of the P =?N P question; or, more accurately, from the point of view of the polynomial-time computability versus ...
60
Algebraic and Combinatorial Methods in Computational Complexity
... in complexity theory: proving super- polynomial lower bounds on the size of ...this problem. The KRW-conjecture states that the formula complexity of two functions f and g roughly adds up when we ...
20
The Computational Complexity of Untrapped Choice Procedures
... the computational complexity of many choice procedures (see for example: [14] [15]) and the literature is full of choice proce- dures that are difficult to compute [15] ...
10
Computational Complexity of Domination Integrity in Graphs
... Abstract. In a graph G, those dominating sets S which give minimum value for |S| + m(G−S), where m(G−S ) denotes the maximum order of a component of G−S, are called dominating integrity sets of G (briefly called DI-sets ...
5