𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational complexity of the integration problem for anisotropic classes

✍ Scribed by Ye Peixin

Publisher
Springer
Year
2005
Tongue
English
Weight
322 KB
Volume
23
Category
Article
ISSN
1019-7168

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The computational complexity of the reli
The computational complexity of the reliability problem on distributed systems
✍ Min-Sheng Lin; Deng-Jyi Chen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 450 KB

The reliability of a distributed program in a distributed computing system is the probability that a program which runs on multiple processing elements and needs to communicate with other processing elements for remote data files will be executed successfully. This reliability varies according to (

The complexity of the matching-cut probl
The complexity of the matching-cut problem for planar graphs and other graph classes
✍ Paul Bonsma πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 247 KB

## Abstract The Matching‐Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be ${\cal{NP}}$‐complete when restricted to graphs with maximum deg