Combinatorial complexity and compositional drift in protein interaction networks. [PDF]
PLoS One, 2012 The assembly of molecular machines and transient signaling complexes does not typically occur under circumstances in which the appropriate proteins are isolated from all others present in the cell.
Deeds EJ +4 more
europepmc +2 more sources
Adjusted Kolmogorov Complexity of Binary Words with Empirical Entropy Normalization. [PDF]
Entropy (Basel)Kolmogorov complexity of a finite binary word reflects both algorithmic structure and the empirical distribution of symbols appearing in the word. Words with symbol frequencies far from one half belong to smaller combinatorial classes and therefore ...
Vidakovic B.
europepmc +2 more sources
Complexity results for the gap inequalities for the max-cut problem [PDF]
, 2012 We prove several complexity results about the gap inequalities for the max-cut problem, including (i) the gap-1 inequalities do not imply the other gap inequalities, unless NP=Co NP; (ii) there must exist non-redundant gap inequalities with exponentially
Galli, Laura +3 more
core +5 more sources
Combinatorial Generation Algorithms for Some Lattice Paths Using the Method Based on AND/OR Trees
Algorithms, 2023 Methods of combinatorial generation make it possible to develop algorithms for generating objects from a set of discrete structures with given parameters and properties.
Yuriy Shablya
doaj +1 more source
A Quantum-Inspired Tensor Network Algorithm for Constrained Combinatorial Optimization Problems
Frontiers in Physics, 2022 Combinatorial optimization is of general interest for both theoretical study and real-world applications. Fast-developing quantum algorithms provide a different perspective on solving combinatorial optimization problems.
Tianyi Hao +5 more
doaj +1 more source
An update on combinatorial method for aggregation of expert judgments in AHP
Production, 2021 Paper aims the paper aims to demonstrate the advantages of several modifications of combinatorial method of expert judgment aggregation in AHP. Modifications are based on 1) weighting of spanning trees; 2) sorting of spanning trees by graph diameter ...
Sergii Kadenko +3 more
doaj +1 more source
, 2021 We develop the ontology of “process complexity” and describe how the dynamics of “becoming” can be framed as the emerging, stabilising, and ultimate dissolving of “patterns of relationships.” By extending traditional complexity thinking through ...
Boulton, Jean
core +1 more source
Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms
Journal of Computational Geometry, 2020 We study algorithms and combinatorial complexity bounds for stable-matching Voronoi diagrams, where a set, $S$, of $n$ point sites in the plane determines a stable matching between the points in $\mathbb{R}^2$ and the sites in $S$ such that (i) the ...
Gill Barequet +3 more
doaj +1 more source
Optimal clearing algorithms for multi-unit single item and multi-unit combinatorial auctions with demand/supply function bidding [PDF]
, 2003 This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexity of our algorithms and prove that they are guaranteed to find the optimal
Jennings, N. R., Dang, V.D.
core +2 more sources
Institutional complexity is complexity with an adjective
, 2021 A review of the studies on institutional complexity reveals that the many definitions of institutional complexity and related concepts share similarities with the understanding of complexity and complex systems of complexity science. Yet few publications
Papin, Marielle
core +1 more source