Complexity and size of the problem
Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification
... fied entries can be repaired, Bernhard Pfahringer is still the winner. Our entry (turney) would then have the second lowest complexity. 5. Conclusions To summarize the results of the East-West Challenge, it seems ...
17
The Complexity of the Empire Colouring Problem
... Theorem 9 Let r and s be fixed positive integers with r ≥ 2, then the s- COL r (TREE) problem is NP-hard if 2 < s < 2r, and polynomial time solvable otherwise. The proof of Theorem 9 is split into two parts. The ...
23
Complexity of the Traveling Tournament Problem
... In order to organize the matches between the different W i , we partition them into sets W i,j of equal size with i ∈ {1, 2, 3}, j ∈ {1, 2}. These encounters are again organized by computing a canonical schedule ...
13
On parameterized complexity of the Multi-MCS problem
... subgraph problem for multiple graphs (Multi-MCS) inspired by various biological applications such as multiple alignments of gene sequences, protein structures, metabolic pathways, or protein–protein interaction ...
9
The Parameterized Complexity of the Survivable Network Design Problem
... solution size, as also detailed in Section ...2-DST problem is a rather straightforward reduction from the W[1]-hard Multicoloured Clique problem and can be found in Section 5 ...
20
On the Complexity of the Circuit Obfuscation Problem for Split Manufacturing
... the problem of finding the optimum edge set remains NP-hard, and therefore unsolvable exactly in an efficient way unless P = ...a size that is O(n 2 ) times the size of the optimum solution for L ...
78
Effect of Problem Complexity on Group Learning and Problem Solving Skills of Medical Students
... (class size at RMC usually exceeds 300 students) and this can be considered as one of the limitation of our ...parameters, complexity and ill- ...a problem, the learners are expected to study the ...
5
A stochastic location-inventory problem: complexity and mathematical formulations.
... Storage capacity limitation is considered because of the possibility of slow sales during the lead time, causing over inventory at the moment an order arrives. This is controlled through a constraint that measures the ...
82
On Sampling Complexity of the Semidefinite Affine Rank Feasibility Problem
... constrained problem, the solution of any Affine Rank Min- imization problem can also be obtained from the solutions of O(n) Affine Rank Feasibility problems of the same ...computational complexity, ...
8
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets
... More precisely, the smallest grammar problem for 1-level grammars is NP-hard for alphabets of size 5 also with respect to the rule size measure, W[1]-hard if parameterised by the number [r] ...
66
Evolution of genome size and complexity in the Rhabdoviridae
... nome size in RNA viruses is likely limited by a high mutation rate, resulting in the evolution of various mechanisms to increase complexity while minimising genome ...genome size from the smallest to ...
25
The Relationship Between Project Size and Complexity
... project size and complexity and certain measures of project ...project size was linked to budget adherence and project ...project size increased the likelihood of adhering to the project ...
10
AS THE Internet continues to grow in size and complexity,
... in size and complexity, the challenge of effectively provisioning, managing and securing it has become inextricably linked to a deep under- standing of Internet ...
12
On the complexity of restricted k-anonymity problem
... k-anonymity problem is its close connection with general k-anonymity ...k-anonymity problem, we could construct an in- stance of the Restricted k-anonymity problem (take ...3-anonymity ...
12
Analyzing runtime and size complexity of integer programs
... the size |i 0 | of its initial value i 0 in all iterations of this ...initial size |x 0 | and |i 0 | 2 ...and size bounds allows us to handle loops whose runtime depends on variables like x that were ...
49
Complexity of Intermediate Size Fermion/Boson Gases
... Keywords: Fermions, Bosons, Statistical complexity, Entropy, Disequilibrium. I. INTRODUCTION Examples of collective phenomena which can emerge from real-world complex systems include traffic congestion, financial ...
15
Size-Independent Sample Complexity of Neural Networks
... Maybe, but doesn’t answer the question (dynamics lead to what kind of network?) This Talk?. Study how parameter norms affect generalization error?[r] ...
65
Complexity and Approximation of the Continuous Network Design Problem
... 1.1 Our Results and Used Techniques. Despite more than forty years of research, to the best of our knowledge, the computational complexity status of CNDP is still unknown. We close this gap as we show that CNDP is ...
16
The complexity of the empire colouring problem for linear forests
... colouring problem implies that s-COL r can be solved in polynomial time for s = 2, as checking whether the reduced graph of an r-empire graph is bipartite is ...
17