aiwiki.page
English

Algorithms & Theory

141 entriesPage 3 of 3
Run-length encoding

Run-length encoding is a lossless compression technique that replaces consecutive repetitions of a value with a representation of that value and its repetition count.

run-length-encoding
Satisfiability Modulo Theories

Satisfiability modulo theories combines Boolean reasoning with mathematical theories to determine whether logical constraints admit a model.

satisfiability-modulo-theories
Shor's Algorithm

Shor’s algorithm uses quantum period finding to factor integers and compute discrete logarithms in polynomial time, challenging widely used public-key cryptography.

shors-algorithm
Shortest Path Problem

The shortest path problem finds a route of minimum total weight between vertices in a graph, with algorithms determined by graph structure and edge weights.

shortest-path-problem
SMT-LIB

SMT-LIB is an international initiative providing standard languages, logical theories, and benchmark collections for satisfiability modulo theories solvers.

smt-lib
Sorting Algorithm

A sorting algorithm rearranges data into a specified order, with performance determined by its comparison model, memory requirements, stability, and input characteristics.

sorting-algorithm
Space Complexity

Space complexity measures how an algorithm’s memory requirements grow with input size, under a specified computational model and accounting convention.

space-complexity
Stable Sorting

Stable sorting preserves the original relative order of elements that compare as equal, allowing earlier ordering information to survive subsequent sorts.

stable-sorting
Stack (Data Type)

A stack is an abstract data type that stores elements in last-in, first-out order, supporting insertion and removal at one designated end.

stack-data-type
Strassen Algorithm

Strassen’s algorithm multiplies matrices using seven recursive block products instead of eight, reducing arithmetic complexity below cubic time.

strassen-algorithm
Strong Exponential Time Hypothesis

The Strong Exponential Time Hypothesis asserts that the exponential-time complexity of Boolean satisfiability approaches exhaustive search as clause width increases.

strong-exponential-time-hypothesis
Time Complexity

Time complexity describes how the computational work required by an algorithm grows with the size of its input under a specified computational model.

time-complexity
Timsort

Timsort is a stable, adaptive sorting algorithm that combines natural merge sort with insertion sort to exploit existing order in data.

timsort
Tree (Data Structure)

A tree is a hierarchical data structure whose parent–child relationships support efficient searching, indexing, prioritization, and representation of nested information.

tree-data-structure
Turing Award

The Turing Award is an annual ACM prize recognizing contributions of lasting and major technical importance to computing.

turing-award
Turing Completeness

Turing completeness is the ability of a computational system, given unbounded resources, to simulate any Turing machine.

turing-completeness
Turing Machine

A Turing machine is an abstract computational model used to define algorithms, establish limits of computability, and analyze computational resources.

turing-machine
Unique Games Conjecture

A conjecture in computational complexity asserting that distinguishing almost satisfiable unique constraint systems from highly unsatisfiable ones is NP-hard.

unique-games-conjecture
Universal Turing Machine

A universal Turing machine is a single abstract computing machine that can simulate any Turing machine from an encoded description and input.

universal-turing-machine
Xorshift

Xorshift is a family of fast pseudorandom number generators that update their state using bitwise exclusive-or and shift operations.

xorshift
Zstandard

Zstandard is a lossless compression algorithm and format designed to combine fast compression and decompression with adjustable compression ratios and support for trained dictionaries.

zstandard