linear-complexity
There are 5 repositories under linear-complexity topic.
fudan-zvg/SOFT
[NeurIPS 2021 Spotlight] & [IJCV 2024] SOFT: Softmax-free Transformer with Linear Complexity
ZJU-FAST-Lab/SDQP
Small-Dimensional Quadratic Programming in Linear Time
discocube/weaver
Algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for graphs with over 8 billion vertices). Discocube graphs are 3-dimensional grid graphs derived from: a polycube of an octahedron | a Hauy construction of an octahedron with cubes as identical building blocks...
discocube/weave_old
An algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for over graphs with 1 billion vertices).
thefallen27/split_a_string
This program takes a string and multiple delimiter characters as input, and splits the string based on said delimiters. The function that performs this returns a vector of tokens, which is actually the input broken down into small strings according to the delimiters provided.