Computational complexity (CC)
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
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
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
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 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
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
A low computational complexity normalized subband adaptive filter algorithm employing signed regressor of input signal
... similar to the conventional NSAF. In addition, the proposed algorithm has lower computational complexity than NSAF due to the signed regressor of the input signal at each subband. The theoretical ...
23
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 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
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
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 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
Computational Complexity of Domination Integrity in Graphs
... Domination Integrity problem is proved to be NP-complete even when G is restricted to planar or chordal graphs2. Hence the decision problem DIG is in NP.[r] ...
5
The Computational Complexity of Avoiding Conversational Implicatures
... Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they may lea[r] ...
8
Computational Complexity of Current GPSG Theory
... A generalized phrase structure grammar contains five languageparticular components - - immediate dominance ID rules, metarules, linear precedence LP statements, feature co-occurrence res[r] ...
10
Computational Complexity in Two Level Morphology
... The fundamental efficiency of finite-state machines promises to make the speed of Kimmo processing largely independent of the nature of the constraints that the automata encode: The most[r] ...
7
Computational Complexity and Lexical Functional Grammar
... The tree is obviously required because the feature checking machinery propagates values according to the links specified by the derivation tree; the assignment of terminal items to categ[r] ...
6
The computational complexity of two state spin systems
... Our proof strategy is to design a redu tion that takes a graph G = V; E of maximum degree 4 and forms a graph G0 with the following informal property: The partition fun tion Z G0 of th[r] ...
20
On the Computational Complexity of the Domination Game
... A(·, ·, k+1) is correct. In a similar way, we prove the correctness of A 0 (·, ·, k +1). Now we prove that the algorithms run in the announced time complexity. The data structure we use for a partially dominated ...
8