Results 61 to 70 of about 5,239,116 (369)
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs [PDF]
Journal of Graph Theory, 2014 For a positive integer k, a k‐coloring of a graph G=(V,E) is a mapping c:V→{1,2,...,k} such that c(u)≠c(v) whenever uv∈E . The Coloring problem is to decide, for a given G and k, whether a k‐coloring of G exists.
P. Golovach +3 more
semanticscholar +1 more source
On the Complexity of Computing Treelength [PDF]
Discrete Applied Mathematics, 2007 AbstractWe resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and asked to determine the complexity of recognizing graphs of a bounded treelength Dourisboure and Gavoille (2007) [6].
openaire +3 more sources
The Computational Complexity of Duality
, 2016 We show that for any given norm ball or proper cone, weak membership in its dual ball or dual cone is polynomial-time reducible to weak membership in the given ball or cone.
Friedland, Shmuel, Lim, Lek-Heng
core +1 more source
An overview on polynomial approximation of NP-hard problems [PDF]
Yugoslav Journal of Operations Research, 2009 The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between
Paschos Vangelis Th.
doaj +1 more source
An overview of computational complexity [PDF]
Communications of the ACM, 1983 An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and parallel computation are discussed.
openaire +6 more sources
occumb: An R package for site occupancy modeling of eDNA metabarcoding data
Population Ecology, EarlyView.This study introduces a new R package, occumb, for the convenient application of site occupancy modeling using environmental DNA (eDNA) metabarcoding data. We outline a data analysis workflow, including data setup, model fitting, model assessment, and comparison of potential study settings based on model predictions, all of which can be performed using
Keiichi Fukaya, Yuta Hasebe
wiley +1 more source
Reducing Computational Complexity of Quantum Correlations
, 2015 We address the issue of reducing the resource required to compute information-theoretic quantum correlation measures like quantum discord and quantum work deficit in two qubits and higher dimensional systems.
A. S. Holevo +12 more
core +1 more source
Depth, Highness and DNR degrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 We study Bennett deep sequences in the context of recursion theory; in particular we investigate the notions of O(1)-deepK, O(1)-deepC , order-deep K and order-deep C sequences. Our main results are that Martin-Loef random sets are not order-deepC , that
Philippe Moser, Frank Stephan
doaj +1 more source
Membrane fission: A computational complexity perspective
Complex, 2016 Membrane fission is a process by which a biological membrane is split into two new ones in the manner that the content of the initial membrane is separated and distributed between the new membranes.
Luis F. Macías-Ramos +4 more
semanticscholar +1 more source
Mechanisms and kinetic assays of aminoacyl‐tRNA synthetases
FEBS Letters, EarlyView.Accurate protein synthesis is crucial for life. The key players are aminoacyl‐tRNA synthetases (AARSs), which read the genetic code by pairing cognate amino acids and tRNAs. AARSs establish high amino acid selectivity by employing physicochemical limits in molecular recognition.
Igor Zivkovic +2 more
wiley +1 more source