• Aucun résultat trouvé

NP-hard

Tile-Packing Tomography Is NP-hard

Tile-Packing Tomography Is NP-hard

... 3 General Proof Structure The proof is by showing, for each non-bar tile T , a polynomial-time reduction from the 3-Color Tomography Problem introduced in [5] and shown to be NP-hard in [4]. In that ...

10

Optimal Joint Subcarrier and Power Allocation in NOMA is Strongly NP-Hard

Optimal Joint Subcarrier and Power Allocation in NOMA is Strongly NP-Hard

... V. C ONCLUSION In this paper, we develop a general framework to study the complexity of various resource allocation problems re- lated to NOMA. The aim is to have a better understanding of these problems and to ...

8

The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard

The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard

... 4 Conclusion In this paper we have proved that the emptiness problem for TAGED is NP- hard if there is at least one negative constraint. It is known that the emptiness problem for TAGED with only ...

10

An overview on polynomial approximation of NP-hard problems

An overview on polynomial approximation of NP-hard problems

... Study and use of approximation preserving reductions is interesting and relevant for both theoretical computer science and operational research communities for two main reasons. The first reason is “structural”. By means ...

35

Differential approximation of  NP-hard problems with equal size feasible solutions

Differential approximation of NP-hard problems with equal size feasible solutions

... − hard if and only if so is π[t] where we remember that ¯ π = (D, S, m, T riv, M in) when π = (D, S, m, T riv, M ax) and ¯¯ π = π; in other words, computing a worst solution of π[t] is as hard as computing ...

13

Protein design: a NP-hard problem in bioinformatics

Protein design: a NP-hard problem in bioinformatics

... Thus any choice over positions 1 and 2 includes a fixed cost of interaction with the backbone equal to -4+-2= -6, which is the best possible lower bound in this case, and the cost of a, [r] ...

43

Extension of NP Optimization Problems

Extension of NP Optimization Problems

... is NP-hard when the number of colors of the precolored set is ...is NP-hard if each color of the precolored set used twice [ 23 ...the NP-completeness result holds if the precolored set ...

198

Problèmes NP-difficiles : approximation modérément exponentielle et complexité paramétrique

Problèmes NP-difficiles : approximation modérément exponentielle et complexité paramétrique

... an NP-hard problem (see for instance ...many NP-hard problems, the best known algorithm works in exponential time O ∗ (γ n ) (meaning O(γ n p(n)) for some polynomial ...

129

Optimal Reconstruction Might be Hard

Optimal Reconstruction Might be Hard

... Theorem 8. The homological simplification problem of 2-dimensional simplicial pairs is NP-complete. Proof. To check that a candidate X is a homological simplification of the p-dimensional pair (K, L), it is ...

11

Designing RNA Secondary Structures Is Hard

Designing RNA Secondary Structures Is Hard

... it. It is considerably easier to exhibit an alternative better structure for a bad sequence. Indeed, in the former case, one needs to argue over all the structures compatible with the sequence, while in the latter, one ...

17

NP-Completeness of ad hoc multicast routing problems

NP-Completeness of ad hoc multicast routing problems

... Ad hoc multicast routing complexity 3 1 Introduction In wired networks, the search for a partial broadcast scheme (multicast scheme) is a hard task. Generally, depending on the evaluation criteria, the problem is ...

12

Soft data and the hard pomeron

Soft data and the hard pomeron

... drops from 661 to 551 for 619 points, nomi- nally a 10 σ effect! More surprisingly, the new sin- gularity has an intercept of 1.39, very close to that obtained in DIS by Donnachie and Landshoff. However, as was already ...

4

Faut-il avoir peur du hard-discount ?

Faut-il avoir peur du hard-discount ?

... fréquentent un peu moins les hypers que la moyenne. La fréquentation des supers et du hard-discount est ici dans la norme. Ce groupe est donc marqué par un éclectisme orienté en faveur des formats de proximité. Il ...

4

Unified approach to hard diffraction

Unified approach to hard diffraction

... dipole formalism. 3 From dipoles to Soft Colour Interaction In Soft Color Interactions models, at least in their formally simpler formula- tions, one expects the following relation between the total structure function ...

5

Computing an Evolutionary Ordering is Hard

Computing an Evolutionary Ordering is Hard

... questions of the Annual New Zealand Phylogenetics Meeting in 2012 [ 5 ]. In this paper we fully answer this question by showing in Section 2 that the problem is NP-complete and remains so even when every set in ...

7

Unifying approach to hard diffraction

Unifying approach to hard diffraction

... between hard and soft components of hard diffraction is expressed via “effective” parameters of a Pomeron interaction determined from leading log perturbative QCD ...

6

Bust-a-Move/Puzzle Bobble Is NP-complete

Bust-a-Move/Puzzle Bobble Is NP-complete

... Bust-a-Move/Puzzle Bobble is NP-Complete Erik D. Demaine ∗ Stefan Langerman † Abstract We prove that the classic 1994 Taito video game, known as Puzzle Bobble or Bust-a-Move, is NP-complete. Our proof ...

10

The Hard Challenge of Aid Coordination

The Hard Challenge of Aid Coordination

... Second, the Delegation of the EU in Mali is relatively strict when it comes to deciding on the suspension of aid for budget support whenever the outcome indicators prove disappointing. Variable tranches are then not ...

12

Does F2 need a hard pomeron?

Does F2 need a hard pomeron?

... rather hard to imagine how su h a er e singularity an totally turn o in hadron-hadron s attering, as the hadrons will sometimes u tuate into small systems of quarks, omparable to those produ ed by the o-shell ...

11

Spéciation et bioaccumulation dans un organisme modèle de U, Np et Am en milieu marin

Spéciation et bioaccumulation dans un organisme modèle de U, Np et Am en milieu marin

... Même si les concentrations introduites dans l’Océan Pacifique suite à cet accident sont très faibles, ce dernier a mis en lumière le besoin de déterminer rapidement les[r] ...

188

Show all 307 documents...

Sujets connexes