Computational Complexity
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
Computational Complexity of Weighted Threshold Games
... In this paper we consider the computational complexity of solution concepts for weighted threshold games. A weighted threshold game is one in which each player is given a nu- meric weight, and a coalition ...
6
Computational Complexity of Capacity Planning Problems under Uncertainty
... The formulation of uncertainty is clearly very powerful. Simultaneously, however, it does not substantially increase the computational complexity of the optimization problems, and we shall show a few ...
8
The computational complexity of approximation of partition functions
... of Holant instances as a graph whose vertices are the constraints and whose edges are the variables. Substituting each vertex of a Holant({F }) instance by the graph fragment gives a reduction from Holant({F }) to #PM. ...
225
A Computational Complexity Reduced Reconfigurable Architecture of DCT
... hardware complexity since shift-add procedures result in rise in bit-width which results in greater hardware complexity of arithmetic models which stick to the shift- add ...less computational ...
7
Computational complexity of ecological and evolutionary spatial dynamics
... the complexity of computing fixation prob- abilities on evolutionary graphs as important open question in the ...the complexity of computing the exact fixation probabilities for graphs and for games on ...
41
PP 2008 43: The Computational Complexity of Quantified Reciprocals
... In this paper we study the computational complexity of reciprocal sentences with quantied antecedents. We put ourselves in the second tradition and treat reciprocal sentences as examples of a natural ...
15
Conference on Computational Complexity Conference Committee Charter
... on Computational Complexity by the general co-chairs and finance ...on Computational Complexity attendees with names and full address information no later than 120 days after a Conference on ...
6
The Computational Complexity of Untrapped Choice Procedures
... In this section we analyze the computational complexity of the weak (resp. strong) Untrapped set. The following algorithm (based on the previous lemma) describes how to get WUt R ( ) for a given pseudo ...
10
Computational Complexity and an Integer Programming Model of Shakashaka
... As mentioned in the literature [2], a lot of pencil-and- paper puzzles have been shown NP-complete. However, the computational complexity of Shakashaka has not yet been studied. In this paper, we prove that ...
6
Computational Complexity of Natural Languages: A Reasoned Overview
... the complexity metric ...of complexity, that is based on an asymptotic notation and abstracts away from many varying details of the basic operations of different computing ...on computational ...
10
Computational Complexity of Statistical Machine Translation
... In this paper we study a set of prob- lems that are of considerable importance to Statistical Machine Translation (SMT) but which have not been addressed satis- factorily by the SMT research community. Over the last ...
8
Computational Complexity of Electrical Power System Problems
... In the first four sections of this chapter, we present mathematical notations and defi- nitions which are shared among all result chapters (Chapters 4 to 6). These parts are essential to understand the model specific ...
133
The Computational Complexity of the Correct Prefix Property for TAGs
... A new upper bound is presented for the computational complexity of the parsing problem for TAGs, under the constraint that input is read from left to right in such a way that errors in t[r] ...
16
Computational Complexity of Probabilistic Disambiguation by means of Tree Grammars
... Computational Complexity of Probabilistic Disambiguation by means of Tree Grammars C o m p u t a t i o n a l C o m p l e x i t y o f P r o b a b i l i s t i c D i s a m b i g u a t i o n by m e a n s[.] ...
6
On the Computational Complexity of Software (Re)Modularization: Elaborations and Opportunities
... As the problem with restricted-case polynomial-time algo- rithms noted above is that n may be very large even if k is very small, it would seem reasonable to relax the require- ment that an algorithm’s runtime be ...
7
On the Computational Complexity of Dominance Links in Grammatical Formalisms
... Extensions The subsumption of Petri nets is not innocuous, as it allows to derive lower bounds on the computational complexity of MLIGs. Among several extensions of Petri net with some branch- ing capacity ...
11
The Computational Complexity of Linear Optics
... Bosons and the permanent Bosons are one of the two basic types of particle in the universe; they include photons and the carriers of nuclear forces. It has been known since work by Caianiello [15] in 1953 (if not ...
110
On the Computational Complexity of the Domination Game
... the complexity point of view of the game, especially motivated by the result from [1] asserting that verifying whether the game domination number of a graph is bounded by a given integer k is ...
8
Computational Complexity A Modern Approach Sanjeev Arora pdf
... The concept of space complexity had already been explored in the 1960s; in particular, Savitch’s theorem predates the Cook-Levin theorem. Stock- meyer and Meyer proved the PSPACE-completeness of TQBF soon after ...
562