Showing 1 - 10 of 15
This article describes how a realistic prediction of the exon regions in deoxyribonucleic acid (DNA) is a key task in the field of genomics. Learning of the protein coding regions is a key aspect of disease identification and designing drugs. These sections of DNA are known as exons, that show...
Persistent link: https://www.econbiz.de/10012046703
Complexity proofs often restrict themselves to stating that the problem at hand is a generalization of some other intractable problem, This proof technique relies on the widely accepted assumptions that complexity results hold regardless of the model formulation used to represent the problem and...
Persistent link: https://www.econbiz.de/10011594619
NP-completeness and other complexity proofs often merely State that the problem at hand is a generalization of some other intractable problem. This proof technique relies on the widely accepted assumption that complexity results hold regardless of the model formulation used to represent the...
Persistent link: https://www.econbiz.de/10011594620
We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...
Persistent link: https://www.econbiz.de/10010279421
Qualitative coalitional games (QCG) are representations of coalitional games in which self interested agents, each with their own individual goals, group together in order to achieve a set of goals which satisfy all the agents within that group. In such a representation, it is the strategy of...
Persistent link: https://www.econbiz.de/10010312249
computational complexity theory of cryptographic algorithms and the mathematical principles behind various encryption and decryption … algorithms. The theory stems from technology. Based on Shannon's information theory, this book systematically introduces the … three main algorithms of public key cryptography, RSA, discrete logarithm and elliptic curve cryptosystem. It aims to …
Persistent link: https://www.econbiz.de/10013176820
Persistent link: https://www.econbiz.de/10011415174
Complexity proofs often restrict themselves to stating that the problem at hand is a generalization of some other intractable problem, This proof technique relies on the widely accepted assumptions that complexity results hold regardless of the model formulation used to represent the problem and...
Persistent link: https://www.econbiz.de/10011744026
NP-completeness and other complexity proofs often merely State that the problem at hand is a generalization of some other intractable problem. This proof technique relies on the widely accepted assumption that complexity results hold regardless of the model formulation used to represent the...
Persistent link: https://www.econbiz.de/10011744028
Qualitative coalitional games (QCG) are representations of coalitional games in which self interested agents, each with their own individual goals, group together in order to achieve a set of goals which satisfy all the agents within that group. In such a representation, it is the strategy of...
Persistent link: https://www.econbiz.de/10005385439