Results 31 to 40 of about 1,427,211 (329)
Natural complexity, computational complexity and depth [PDF]
Chaos: An Interdisciplinary Journal of Nonlinear Science, 2011 Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a typical system state or history starting from simple initial conditions.
openaire +3 more sources
Computational Complexity in Additive Hedonic Games [PDF]
, 2008 We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive.
Dimitrov, Dinko, Sung, Shao-Chin
core +4 more sources
Scientific Reports, 2017 Recently, growth mechanism of firms in complex business networks became new targets of scientific study owing to increasing availability of high quality business firms’ data.
Hayato Goto +4 more
doaj +1 more source
Computational Oncology in the Multi-Omics Era: State of the Art
Frontiers in Oncology, 2020 Cancer is the quintessential complex disease. As technologies evolve faster each day, we are able to quantify the different layers of biological elements that contribute to the emergence and development of malignancies.
Guillermo de Anda-Jáuregui +3 more
doaj +1 more source
The Computational Complexity of Propositional Cirquent Calculus [PDF]
, 2015 Introduced in 2006 by Japaridze, cirquent calculus is a refinement of sequent calculus. The advent of cirquent calculus arose from the need for a deductive system with a more explicit ability to reason about resources.
Bauer, Matthew Steven
core +1 more source
Performance of Some Estimators of Relative Variability
Frontiers in Applied Mathematics and Statistics, 2019 The classic coefficient of variation (CV) is the ratio of the standard deviation to the mean and can be used to compare normally distributed data with respect to their variability, this measure has been widely used in many fields. In the Social Sciences,
Raydonal Ospina +1 more
doaj +1 more source
Computational Complexity and Phase Transitions
, 2000 Phase transitions in combinatorial problems have recently been shown to be useful in locating "hard" instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been addressed in ...
Istrate, Gabriel
core +1 more source
Efficient inner product arguments and their applications in range proofs
IET Information Security, 2023 Inner product arguments allow a prover to prove that the inner product of two committed vectors equals a public scalar. They are used to reduce the complexity of many cryptographic primitives, such as range proofs.
Zibo Zhou +4 more
doaj +1 more source
Complexity theory for spaces of integrable functions [PDF]
Logical Methods in Computer Science, 2017 This paper investigates second-order representations in the sense of Kawamura and Cook for spaces of integrable functions that regularly show up in analysis. It builds upon prior work about the space of continuous functions on the unit interval: Kawamura
Florian Steinberg
doaj +1 more source
Lower Bound on Weights of Large Degree Threshold Functions [PDF]
Logical Methods in Computer Science, 2013 An integer polynomial $p$ of $n$ variables is called a \emph{threshold gate} for a Boolean function $f$ of $n$ variables if for all $x \in \zoon$ $f(x)=1$ if and only if $p(x)\geq 0$.
Vladimir V. Podolskii
doaj +1 more source