7,821 results for Computational complexity theory - Wikipedia

arxiv.org/abs/2004.14640v1

Stable Roommate Problem with Diversity Preferences

In the multidimensional stable roommate problem, agents have to be allocated to rooms and have preferences over sets of potential roommates. We study the complexity of finding good allocations of agents to rooms under the assumption that agents have...

arxiv.org/abs/1512.01781v1

k-Trails: Recognition, Complexity, and Approximations

The notion of degree-constrained spanning hierarchies, also called k-trails, was recently introduced in the context of network routing problems. They describe graphs that are homomorphic images of connected graphs of degree at most k. First results h...

arxiv.org/abs/2108.08477v1

Image2Lego: Customized LEGO Set Generation from Images

Although LEGO sets have entertained generations of children and adults, the challenge of designing customized builds matching the complexity of real-world or imagined scenes remains too great for the average enthusiast. In order to make this feat pos...

arxiv.org/abs/1404.7195v1

Fast Approximation of Rotations and Hessians matrices

A new method to represent and approximate rotation matrices is introduced. The method represents approximations of a rotation matrix $Q$ with linearithmic complexity, i.e. with $\frac{1}{2}n\lg(n)$ rotations over pairs of coordinates, arranged in an...

arxiv.org/abs/1805.02714v4

Span Program for Non-binary Functions

Span programs characterize the quantum query complexity of binary functions $f:\{0,\ldots,\ell\}^n \to \{0,1\}$ up to a constant factor. In this paper we generalize the notion of span programs for functions with non-binary input/output alphabets $f:...

arxiv.org/abs/2402.03905v1

Employee Turnover Analysis Using Machine Learning Algorithms

Employee's knowledge is an organization asset. Turnover may impose apparent and hidden costs and irreparable damages. To overcome and mitigate this risk, employee's condition should be monitored. Due to high complexity of analyzing well-being feature...

arxiv.org/abs/2112.12881v1

Classifying invariants for $E_1$: A tail of a generic real

Let $E$ be an analytic equivalence relation on a Polish space. We introduce a framework for studying the possible "reasonable" complete classifications and the complexity of possible classifying invariants for $E$, such that: (1) the standard results...

www.bing.com/ck/a?!&&p=7dde773af6885b0f13abb85c889c9e9bfd33e11eb9514d4f78096251ca63bbb9JmltdHM9MTc3MjU4MjQwMA&ptn=3&ver=2&hsh=4&fclid=233dbe49-9b18-6ca4-195e-a95b9aab6d01&u=a1aHR0cHM6Ly9ydWJ5b25yYWlscy5vcmcv&ntb=1

Ruby on Rails: Compress the complexity of modern web apps

Jan 22, 2026 · Everything you need. Rails is a full-stack framework. It ships with all the tools needed to build amazing web apps on both the front and back end.

www.bing.com/ck/a?!&&p=27dbc8ace4b9907fa5f2c4d3f60430b50bf73b12d5ad29428bc968cfbef40b6bJmltdHM9MTc3MjU4MjQwMA&ptn=3&ver=2&hsh=4&fclid=1e1564c6-d214-61c7-2d57-73d4d3fa603e&u=a1aHR0cHM6Ly9kb29kbGVhcnRjbHViLmNvbS9ob3ctdG8tZHJhdy1hLW1hbmRhbGEtc3RlcC1ieS1zdGVwLWd1aWRlLWZyZWUtdGVtcGxhdGVzLw&ntb=1

How to Draw a Mandala: Step-by-Step Guide (+ Free Templates!) …

Mandalas are made up of various shapes that contribute to their symmetry and complexity. Here are some fundamental elements you can incorporate into your design:

github.com/victorkreutzfeldt/low-cplx-xl-mimo-detection

victorkreutzfeldt/low-cplx-xl-mimo-detection

Codes for reproducing the numerical results reported in: "Low-Complexity Distributed XL-MIMO for Multiuser Detection" by Victor Croisfelt, Abolfazl Amiri, Taufik Abrão, Elisabeth de Carvalho, and Petar Popovski. (⭐ 15)

arxiv.org/abs/2106.01801v1

An Information-oriented Model of Multi-Scale (Feedback) Systems

Multi-scale structures are prevalent in both natural and artificial systems, as they can handle increasing complexity. Several terms are employed almost interchangeably across various application domains to refer to the multi-scale concept - e.g., hi...

arxiv.org/abs/1003.3047v2

On the Relative Strength of Pebbling and Resolution

The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven a useful tool for studying resolution-based proof systems when comparing the strength of different subsystems, showing bounds on pr...