Results 61 to 70 of about 1,436,280 (161)

Special Issue on Reconfiguration Problems

Algorithms, 2018
The study of reconfiguration problems has grown into a field of its own. The basic idea is to consider the scenario of moving from one given (feasible) solution to another, maintaining feasibility for all intermediate solutions.
Faisal Abu-Khzam, Henning Fernau, Ryuhei Uehara   +2 more
doaj   +1 more source

Constructive Separations and Their Consequences [PDF]

TheoretiCS
For a complexity class $C$ and language $L$, a constructive separation of $L \notin C$ gives an efficient algorithm (also called a refuter) to find counterexamples (bad inputs) for every $C$-algorithm attempting to decide $L$.
Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams   +3 more
doaj   +1 more source

Depth lower bounds in Stabbing Planes for combinatorial principles [PDF]

Logical Methods in Computer Science
Stabbing Planes (also known as Branch and Cut) is a proof system introduced very recently which, informally speaking, extends the DPLL method by branching on integer linear inequalities instead of single variables.
Stefan Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin   +3 more
doaj   +1 more source

Why Philosophers Should Care About Computational Complexity [PDF]

, 2011
One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong.
Aaronson, Scott
core   +4 more sources

Low Complexity V-BLAST MIMO-OFDM Detector by Successive Iterations Reduction

, 2015
V-BLAST detection method suffers large computational complexity due to its successive detection of symbols. In this paper, we propose a modified V-BLAST algorithm to decrease the computational complexity by reducing the number of detection iterations ...
Abuelenin, Sherif, Ahmed, Karam, Al-Barbary, Khairy, Soliman, Heba   +3 more
core   +2 more sources

Functional impact of multi-omic interactions in lung cancer

Frontiers in Genetics
Lung tumors are a leading cause of cancer-related death worldwide. Lung cancers are highly heterogeneous on their phenotypes, both at the cellular and molecular levels.
Miguel Ángel Díaz-Campos, Jorge Vasquez-Arriaga, Soledad Ochoa, Soledad Ochoa, Enrique Hernández-Lemus, Enrique Hernández-Lemus   +5 more
doaj   +1 more source

Computer science, computer, computational complexity

Chebyshevskii sbornik, 2021
Vladimir Nikolaevich Chubarikov, Nikolai Nikolaevich Dobrovol’skii, Irina Yurievna Rebrova, Nikolai Mihailovich Dobrovol’skii   +3 more
openaire   +2 more sources

Computational Complexity of the Interleaving Distance

, 2018
The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings.
Bjerkevik, Håvard Bakke, Botnan, Magnus Bakke   +1 more
core  

The Computational Complexity of the Traveling Salesman Problem [PDF]

, 2011
In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.Comment: 1 page, made a minor ...
Feinstein, Craig Alan
core   +2 more sources

On the Complexity of Target Set Selection in Simple Geometric Networks [PDF]

Discrete Mathematics & Theoretical Computer Science
We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a healthy individual
Michal Dvořák, Dušan Knop, Šimon Schierreich   +2 more
doaj   +1 more source