EXPTIMEIn computational complexity theory, the complexity class EXPTIME (sometimes called EXP or DEXPTIME) is the set of all decision problems that are solvable by a deterministic…View analysis →
NEXPTIMEIn computational complexity theory, the complexity class NEXPTIME (sometimes called NEXP) is the set of decision problems that can be solved by a non-deterministic Turing machine…View analysis →
Alternating Turing machineIn computational complexity theory, an alternating Turing machine (ATM) is a non-deterministic Turing machine (NTM) with a rule for accepting computations that generalizes the…View analysis →
Linked data structureIn computer science, a linked data structure is a data structure which consists of a set of data records (nodes) linked together and organized by references (links or pointers)…View analysis →
NSPACEIn computational complexity theory, non-deterministic space or NSPACE is the computational resource describing the memory space for a non-deterministic Turing machine. It is the…View analysis →
SMAWK algorithmThe SMAWK algorithm is an algorithm for finding the minimum value in each row of an implicitly defined totally monotone matrix. It is named after the initials of its five…View analysis →
AlgorithmIn mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ ⓘ) is a finite sequence of mathematically rigorous logical instructions, typically used to solve a class of…View analysis →
Algorithmic tradingAlgorithmic trading is a method of executing orders using automated pre-programmed trading instructions accounting for variables such as time, price, and volume. This type of…View analysis →
User interfaceIn the industrial design field of human–computer interaction, a user interface (UI) is the space where interactions between humans and machines occur. The goal of this…View analysis →
Genetic algorithmA genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA) in computer science and…View analysis →
Computability theoryComputability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the…View analysis →
2D computer graphics2D computer graphics is the computer-based generation of digital images—mostly from two-dimensional models (such as 2D geometric models, text, and digital images) and by…View analysis →
Data and information visualizationData and information visualization (data viz/vis or info viz/vis) is the practice of designing and creating graphic or visual representations of quantitative and qualitative data…View analysis →
Evolutionary algorithmEvolutionary algorithms (EA) reproduce essential elements of biological evolution in a computer algorithm in order to solve "difficult" problems, at least approximately, for…View analysis →
Instruction set architectureAn instruction set architecture (ISA) is an abstract model that defines the programmable interface of the CPU of a computer, defining how software interacts with hardware. A…View analysis →
Turing machineA Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Despite the…View analysis →
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…View analysis →
Text-based user interfaceIn computing, text-based user interfaces (TUI) (alternately terminal user interfaces, to reflect a dependence upon the properties of computer terminals and not just text), is a…View analysis →
Biological data visualizationBiological data visualization is a branch of bioinformatics concerned with the application of computer graphics, scientific visualization, and information visualization to…View analysis →
3D computer graphics3D computer graphics, sometimes called 3D computer-generated imagery (3D-CGI), refers to computer graphics that use a three-dimensional (3D) representation of geometric data…View analysis →
Computational complexityIn computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation…View analysis →
Universal Turing machineIn computer science, a universal Turing machine (UTM) is a Turing machine capable of computing any computable sequence, as described by Alan Turing in his seminal paper "On…View analysis →
Descriptive complexity theoryDescriptive complexity is a branch of computational complexity theory and of finite model theory that characterizes complexity classes by the type of logic needed to express the…View analysis →
P6 (microarchitecture)The P6 microarchitecture is the sixth-generation Intel x86 microarchitecture, first implemented in the Pentium Pro microprocessor in 1995. It was partially succeeded by the…View analysis →
Interaction design patternInteraction design patterns are design patterns applied in the context human–computer interaction, describing common designs for graphical user interfaces.View analysis →
Multithreading (computer architecture)In computer architecture, multithreading is the ability of a central processing unit (CPU) (or a single core in a multi-core processor) to provide multiple threads of execution.View analysis →
Implicit data structureIn computer science, an implicit data structure or space-efficient data structure is a data structure that stores very little information other than the main or required data: a…View analysis →
Graphical user interfaceA graphical user interface, or GUI, is a form of user interface that allows users to interact with electronic devices through graphical icons and visual indicators such as…View analysis →
Distributed hash tableA distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. Key–value pairs are stored in a DHT, and any participating node can…View analysis →