NP-completenessIn computational complexity theory, a problem is NP-complete when: It is a decision problem, meaning that for any input to the problem, the output is either "yes" or "no". When the answer is "yes", this can be demonstrated through the existence of a short (polynomial length) solution. The correctness of each solution can be verified quickly (namely, in polynomial time) and a brute-force search algorithm can find a solution by trying all possible solutions.
Public-key cryptographyPublic-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a public key and a corresponding private key. Key pairs are generated with cryptographic algorithms based on mathematical problems termed one-way functions. Security of public-key cryptography depends on keeping the private key secret; the public key can be openly distributed without compromising security.
Fritz the CatFritz the Cat is a comic strip created by Robert Crumb. Set in a "supercity" of anthropomorphic animals, it focused on Fritz, a tabby cat who frequently went on wild adventures that sometimes involved sexual escapades. Crumb began drawing the character in homemade comic books as a child. Fritz became one of his best-known characters, thanks largely to the motion picture adaptation by Ralph Bakshi.
Band-stop filterIn signal processing, a band-stop filter or band-rejection filter is a filter that passes most frequencies unaltered, but attenuates those in a specific range to very low levels. It is the opposite of a band-pass filter. A notch filter is a band-stop filter with a narrow stopband (high Q factor). Narrow notch filters (optical) are used in Raman spectroscopy, live sound reproduction (public address systems, or PA systems) and in instrument amplifiers (especially amplifiers or preamplifiers for acoustic instruments such as acoustic guitar, mandolin, bass instrument amplifier, etc.
Time complexityIn computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor.
Sorting algorithmIn computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order and lexicographical order, and either ascending or descending. Efficient sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output.
Monkey mindMonkey mind or mind monkey, from the Chinese compound xīnyuán and the Sino-Japanese compound shin'en 心猿 [lit. "heart-/mind-monkey"], is a Buddhist term meaning "unsettled; restless; capricious; whimsical; fanciful; inconstant; confused; indecisive; uncontrollable". In addition to Buddhist writings, including Chan or Zen, Consciousness-only, Pure Land, and Shingon, this "mind-monkey" psychological metaphor was adopted in Taoism, Neo-Confucianism, poetry, drama, and literature.
InterpolationIn the mathematical field of numerical analysis, interpolation is a type of estimation, a method of constructing (finding) new data points based on the range of a discrete set of known data points. In engineering and science, one often has a number of data points, obtained by sampling or experimentation, which represent the values of a function for a limited number of values of the independent variable. It is often required to interpolate; that is, estimate the value of that function for an intermediate value of the independent variable.
Original sin'Original sin' is the Christian doctrine that holds that humans, through the fact of birth, inherit a tainted nature with a proclivity to sinful conduct in need of regeneration. The biblical basis for the belief is generally found in Genesis 3 (the story of the expulsion of Adam and Eve from the Garden of Eden), in a line in Psalm 51:5 ("I was brought forth in iniquity, and in sin did my mother conceive me"), and in Paul's Epistle to the Romans, 5:12-21 ("Therefore, just as sin entered the world through one man, and death through sin, and in this way death came to all people, because all sinned").
Travelling salesman problemThe travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research. The travelling purchaser problem and the vehicle routing problem are both generalizations of TSP.
