Results 41 to 50 of about 1,437,104 (331)
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 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
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
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
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
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
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
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
Computational Complexity for Physicists [PDF]
, 2002 These lecture notes are an informal introduction to the theory of computational complexity and its links to quantum computing and statistical mechanics.Comment: references updated, reprint available from http://itp.nat.uni-magdeburg.de/~mertens/papers ...
Mertens, Stephan
core +2 more sources