intractability
81McEliece cryptosystem — In cryptography, the McEliece cryptosystem is an asymmetric encryption algorithm developed in 1978 by Robert McEliece.[1] It was the first such scheme to use randomization in the encryption process. The algorithm has never gained much acceptance… …
82Computational — may refer to: Computer Computational algebra Computational Aeroacoustics Computational and Information Systems Laboratory Computational and Systems Neuroscience Computational archaeology Computational auditory scene analysis Computational biology …
83Steve Perry (musician) — Infobox musical artist | Name = Steve Perry Img size= Img capt=Steve Perry in 1981 Background = solo singer Birth name = Stephen Ray Perry Alias = Born = birth date and age|1949|1|22 Hanford, California Died = Instrument = Vocals Genre = Rock… …
84L (complexity) — In computational complexity theory, L (also known as LSPACE) is the complexity class containing decision problems which can be solved by a deterministic Turing machine using a logarithmic amount of memory space. Logarithmic space is sufficient to …
85List of undecidable problems — In computability theory, an undecidable problem is a problem whose language is not a recursive set. More informally, such problems cannot be solved in general by computers; see decidability. This is a list of undecidable problems. Note that there …
86Peace process in the Israeli–Palestinian conflict — Part of a series on the Israeli–Palestinian conflict and Arab–Israeli conflict Israeli–Palestinian peace process …
87Election monitoring — is the observation of an election by one or more independent parties, typically from another country or a non governmental organization (NGO), primarily to ensure the fairness of the election process. There are national and international election …
88Cramer-Shoup cryptosystem — The Cramer Shoup system is an asymmetric key encryption algorithm, and was the first efficient scheme proven to be secure against adaptive chosen ciphertext attack using standard cryptographic assumptions. Its security is based on the… …
89Metric dimension (graph theory) — In graph theory, the metric dimension of a graph G is the minimum number of vertices in a subset S of G such that all other vertices are uniquely determined by their distances to the vertices in S. Finding the metric dimension of a graph is an NP …
90List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… …
