When checking that solutions to certain problems are correct, it turns out, you can’t get around the inherent complexity of ...

Combinatorial optimization problems are often encountered in real-world applications, including logistics, scheduling and ...

Zoraptera, also known as angel insects or ground lice, are tiny termite-like insects generally found underneath bark or in ...

Abstract: Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to ...

In recent years, the frequency of weather-related natural disasters—cyclones, torrential rains, floods—has increased as a consequence of global warming. These disasters cause billions of dollars in ...

Goodhart's Law ("When a measure becomes a target, it ceases to be a good measure.") has been around long enough that it ...

Fault-tolerant quantum simulation just got 250 times cheaper to run. QuEra Computing and Los Alamos published an architecture ...

NP-complete for general graphs APX-hard: difficult to approximate within a constant factor Generalizes well-known problems such as maximum clique and subgraph isomorphism ...

Timely reconstruction of epidemic dynamics is essential for public health, and structured coalescent models constitute an essential tool for this purpose. However, statistical and computational ...

For many, Social Security benefits are a key part of their retirement plan. So it makes sense that you would want to get the most possible from this monthly source of income. As of 2025, the maximum ...

Using an advanced Monte Carlo method, Caltech researchers found a way to tame the infinite complexity of Feynman diagrams and solve the long-standing polaron problem, unlocking deeper understanding of ...

We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it ...