49 relations: Accelerando, Applied mathematics, Approximation algorithm, Baby-step giant-step, Backpack, Big O notation, Bin packing problem, Change-making problem, Combinatorial auction, Combinatorial optimization, Combinatorics, Computational complexity theory, Computer science, Computers and Intractability, Continuous knapsack problem, Cryptography, Cryptonomicon, Cutting stock problem, Daily fantasy sports, David S. Johnson, Decision problem, Dungeons & Dragons, Dynamic programming, Fixed-point arithmetic, George Dantzig, Greatest common divisor, Greedy algorithm, Hybrid algorithm, Investment, Karp's 21 NP-complete problems, Knapsack cryptosystems, List of knapsack problems, Meet-in-the-middle attack, Merkle–Hellman knapsack cryptosystem, NP-completeness, NP-hardness, Packing problems, Polynomial-time approximation scheme, Portfolio (finance), Pseudo-polynomial time, Public-key cryptography, Quadratic knapsack problem, Resource allocation, Rosetta Code, Securitization, Subset sum problem, Suffix tree, The Elder Scrolls, Tobias Dantzig.
Accelerando is a 2005 science fiction novel consisting of a series of interconnected short stories written by British author Charles Stross.
Applied mathematics is the application of mathematical methods by different fields such as science, engineering, business, computer science, and industry.
In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to NP-hard optimization problems with provable guarantees on the distance of the returned solution to the optimal one.
In group theory, a branch of mathematics, the baby-step giant-step is a meet-in-the-middle algorithm for computing the discrete logarithm.
A backpack — also called bookbag, kitbag, knapsack, rucksack, rucksac, pack, sackpack or backsack — is, in its simplest form, a cloth sack carried on one's back and secured with two straps that go over the shoulders, but there can be variations to this basic design.
Big O notation is a mathematical notation that describes the limiting behaviour of a function when the argument tends towards a particular value or infinity.
In the bin packing problem, objects of different volumes must be packed into a finite number of bins or containers each of volume V in a way that minimizes the number of bins used.
The change-making problem, also known as minimum coin change problem, addresses the question of finding the minimum number of coins (of certain denominations) that add up to a given amount of money refer.
A combinatorial auction is a type of smart market in which participants can place bids on combinations of discrete items, or “packages”, rather than individual items or continuous quantities.
In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures.
Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.
Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.
In computer science, more specifically computational complexity theory, Computers and Intractability: A Guide to the Theory of NP-Completeness is an influential textbook by Michael Garey and David S. Johnson.
In theoretical computer science, the continuous knapsack problem (also known as the fractional knapsack problem) is an algorithmic problem in combinatorial optimization in which the goal is to fill a container (the "knapsack") with fractional amounts of different materials chosen to maximize the value of the selected materials.
Cryptography or cryptology (from κρυπτός|translit.
Cryptonomicon is a 1999 novel by American author Neal Stephenson, set in two different time periods.
In operations research, the cutting-stock problem is the problem of cutting standard-sized pieces of stock material, such as paper rolls or sheet metal, into pieces of specified sizes while minimizing material wasted.
Daily fantasy sports (DFS) are a subset of fantasy sport games.
David Stifler Johnson (December 9, 1945 – March 8, 2016) was an American computer scientist specializing in algorithms and optimization.
In computability theory and computational complexity theory, a decision problem is a problem that can be posed as a yes-no question of the input values.
Dungeons & Dragons (abbreviated as D&DMead, Malcomson; ''Dungeons & Dragons'' FAQ or DnD) is a fantasy tabletop role-playing game (RPG) originally designed by Gary Gygax and Dave Arneson.
Dynamic programming is both a mathematical optimization method and a computer programming method.
In computing, a fixed-point number representation is a real data type for a number that has a fixed number of digits after (and sometimes also before) the radix point (after the decimal point '.' in English decimal notation).
George Bernard Dantzig (November 8, 1914 – May 13, 2005) was an American mathematical scientist who made important contributions to operations research, computer science, economics, and statistics.
In mathematics, the greatest common divisor (gcd) of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers.
A greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each stage with the intent of finding a global optimum.
A hybrid algorithm is an algorithm that combines two or more other algorithms that solve the same problem, either choosing one (depending on the data), or switching between them over the course of the algorithm.
In general, to invest is to allocate money (or sometimes another resource, such as time) in the expectation of some benefit in the future – for example, investment in durable goods, in real estate by the service industry, in factories for manufacturing, in product development, and in research and development.
In computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete.
Knapsack Cryptosystems are cryptosystems which security is based on the hardness of solving the knapsack problem.
The knapsack problem is one of the most studied problems in combinatorial optimization, with many real-life applications.
The meet-in-the-middle attack (MITM) is a generic space–time tradeoff cryptographic attack against encryption schemes which rely on performing multiple encryption operations in sequence.
The Merkle–Hellman knapsack cryptosystem was one of the earliest public key cryptosystems invented by Ralph Merkle and Martin Hellman in 1978.
In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.
NP-hardness (''n''on-deterministic ''p''olynomial-time hardness), in computational complexity theory, is the defining property of a class of problems that are, informally, "at least as hard as the hardest problems in NP".
Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers.
In computer science, a polynomial-time approximation scheme (PTAS) is a type of approximation algorithm for optimization problems (most often, NP-hard optimization problems).
In finance, a portfolio is a collection of investments held by an investment company, hedge fund, financial institution or individual.
In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is a polynomial in the numeric value of the input (the largest integer present in the input) — but not necessarily in the length of the input (the number of bits required to represent it), which is the case for polynomial time algorithms.
Public-key cryptography, or asymmetric cryptography, is any cryptographic system that uses pairs of keys: public keys which may be disseminated widely, and private keys which are known only to the owner.
The quadratic knapsack problem (QKP), first introduced in 19th century, is an extension of knapsack problem that allows for quadratic terms in the objective function: Given a set of items, each with a weight, a value, and an extra profit that can be earned if two items are selected, determine the number of item to include in a collection without exceeding capacity of the knapsack, so as to maximize the overall profit.
In economics, resource allocation is the assignment of available resources to various uses.
Rosetta Code is a wiki-based programming chrestomathy website with implementations of common algorithms and solutions to various programming problems in many different programming languages.
Securitization is the financial practice of pooling various types of contractual debt such as residential mortgages, commercial mortgages, auto loans or credit card debt obligations (or other non-debt assets which generate receivables) and selling their related cash flows to third party investors as securities, which may be described as bonds, pass-through securities, or collateralized debt obligations (CDOs).
In computer science, the subset sum problem is an important problem in complexity theory and cryptography.
In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a compressed trie containing all the suffixes of the given text as their keys and positions in the text as their values.
The Elder Scrolls is a series of action role-playing open world fantasy video games primarily developed by Bethesda Game Studios and published by Bethesda Softworks.
Tobias Dantzig (February 19, 1884 – August 9, 1956) was a mathematician of Baltic German and Russian American heritage, the father of George Dantzig, and the author of Number: The Language of Science (A critical survey written for the cultured non-mathematician) (1930) and Aspects of Science (New York, Macmillan, 1937).
0-1 Knapsack problem, 0-1 knapsack problem, 0/1 knapsack problem, Algorithms for solving knapsack problems, BKP, Backpack problem, Binary knapsack problem, Integer knapsack problem, Knapsack Problem, Napsack problem, Unbounded Knapsack Problem, Unbounded knapsack problem.