7,821 results for Computational complexity theory - Wikipedia

arxiv.org/abs/1901.00302v1

openCoT: The opensource Cloud of Things platform

In order to address the complexity and extensiveness of technology, Cloud Computing is utilized with four main service models. The most recent service model, function-as-a-service, enables developers to develop their application in a function-based s...

arxiv.org/abs/2206.04883v2

On the Complexity of Sampling Redistricting Plans

A crucial task in the political redistricting problem is to sample redistricting plans i.e. a partitioning of the graph of census blocks into districts. We show that Recombination [DeFord-Duchin-Solomon'21]-a popular Markov chain to sample redistri...

www.bing.com/ck/a?!&&p=9699412c46a8b5c9e3023409dd4ed48151b44a62d4d72bba261919b2a44381a5JmltdHM9MTc3MjQ5NjAwMA&ptn=3&ver=2&hsh=4&fclid=39b21297-9c1d-663f-046c-05859dd867c2&u=a1aHR0cHM6Ly93d3cud2Vmb3J1bS5vcmcvc3Rvcmllcy8yMDI1LzAyL2JpZ2dlc3QtY3liZXJzZWN1cml0eS10aHJlYXRzLTIwMjUv&ntb=1

Discover the must-read cybersecurity stories of the past month | World ...

Feb 19, 2025 · The growing complexity of cyberspace is bringing new and ever-present cybersecurity threats. Image: World Economic Forum/Accenture While 66% of organizations see AI as the biggest …

arxiv.org/abs/2511.10202v2

Algorithms and Complexity of Hedge Cluster Deletion Problems

A hedge graph is a graph whose edge set has been partitioned into groups called hedges. Here we consider a generalization of the well-known \textsc{Cluster Deletion} problem, named \textsc{Hedge Cluster Deletion}. The task is to compute the minimum n...

www.bing.com/ck/a?!&&p=b28dc9907d94db5a73f4d7a06466e8ce1d79a98daf8105e95e1d688d91227fcbJmltdHM9MTc3MjQ5NjAwMA&ptn=3&ver=2&hsh=4&fclid=0276c127-7a2e-6dd7-0183-d6357b826ccc&u=a1aHR0cHM6Ly93d3cubnVjbGVhcmJsYXN0LmNvbS9wYWdlcy9vYnNjdXJh&ntb=1

Obscura - All about the band | Nuclear Blast

In 2025, Obscura will lighthouse their musical prowess, thematic complexity, and lyrical ambition on „A Sonication“. The group continue to be a beacon for change. No doubt Obscura’s new stats will …

arxiv.org/abs/1912.04816v2

Qualitative Numeric Planning: Reductions and Complexity

Qualitative numerical planning is classical planning extended with non-negative real variables that can be increased or decreased "qualitatively", i.e., by positive indeterminate amounts. While deterministic planning with numerical variables is undec...

arxiv.org/abs/2406.02737v1

CAMP: Compiler and Allocator-based Heap Memory Protection

The heap is a critical and widely used component of many applications. Due to its dynamic nature, combined with the complexity of heap management algorithms, it is also a frequent target for security exploits. To enhance the heap's security, various...

arxiv.org/abs/0908.4388v1

Analyzing Netizen's View and Reply Behaviors on the Forum

Quantitative understanding of human behaviors provides elementary comprehension of the complexity of many human-initiated systems. In this paper, we investigate the behavior of people on the $BBS$ forum by the statistical analysis of the amounts of...

arxiv.org/abs/2108.02589v1

TRANSMUT-SPARK: Transformation Mutation for Apache Spark

We propose TRANSMUT-Spark, a tool that automates the mutation testing process of Big Data processing code within Spark programs. Apache Spark is an engine for Big Data Processing. It hides the complexity inherent to Big Data parallel and distributed...

arxiv.org/abs/2012.12126v1

Structure and Complexity of Bag Consistency

Since the early days of relational databases, it was realized that acyclic hypergraphs give rise to database schemas with desirable structural and algorithmic properties. In a by-now classical paper, Beeri, Fagin, Maier, and Yannakakis established se...

arxiv.org/abs/2002.11795v5

Quantum Distributed Complexity of Set Disjointness on a Line

Set Disjointness on a Line is a variant of the Set Disjointness problem in a distributed computing scenario with $d+1$ processors arranged on a path of length $d$. It was introduced by Le Gall and Magniez (PODC 2018) for proving lower bounds on the q...