intractability
111Track II diplomacy — is a specific kind of informal diplomacy, in which non officials (academic scholars, retired civil and military officials, public figures, and social activists) engage in dialogue, with the aim of conflict resolution, or confidence building.… …
112AI winter — See also and An AI Winter is a collapse in the perception of artificial intelligence research. The term was coined by analogy with the relentless spiral of a nuclear winter: a chain reaction of pessimism in the AI community, followed by pessimism …
113One-in-three 3SAT — In computational complexity theory, one in three 3SAT (also known variously as 1 in 3 SAT and exactly 1 3SAT) is an NP complete problem. The problem is a variant of the 3 satisfiability problem (3SAT). Like 3SAT, the input instance is a… …
114Multiple sequence alignment — A multiple sequence alignment (MSA) is a sequence alignment of three or more biological sequences, generally protein, DNA, or RNA. In many cases, the input set of query sequences are assumed to have an evolutionary relationship by which they… …
115Maximum common subgraph isomorphism problem — In complexity theory, maximum common subgraph isomorphism (MCS) is an optimization problem that is known to be NP hard. The formal description of the problem is as follows: Maximum common subgraph isomorphism(G1, G2) Input: Two graphs G1 and G2.… …
116List of independent discoveries — Independent discoveries in science, termed multiples by Robert K. Merton, are instances in which similar discoveries are made by scientists working independently of each other. [http://books.google.com/books?vid=ISBN0226520714 id=eprv7hMdO IC… …
1173-partition problem — The 3 partition problem is an NP complete problem in computer science. The problem is to decide whether a given multiset of integers can be partitioned into triples that all have the same sum. More precisely, given a multiset S of n = 3 m… …
118Higher residuosity problem — In cryptography most public key cryptosystems are founded on problems that are believed to be intractable. The higher residuosity problem is one such problem. This problem is easier to solve than integer factorization, so the assumption that this …
119Strongly NP-complete — In computational complexity, strong NP completeness is a property of computational problems that is a special case of NP completeness. Ageneral computational problem may have numerical parameters. For example, the input to the Bin packing problem …
120Deep democracy — is a psycho social political paradigm and methodology. The term Deep Democracy was developed by Arny Mindell in 1988 and first appeared in Leader as Martial Artist (Mindell, 1992). Mindell, a physicist and Jungian Analyst had researched and… …
