Results 51 to 60 of about 5,239,116 (369)
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
From the Physics to the Computational Complexity of Multiboson Correlation Interference. [PDF]
Physical Review Letters, 2015 We demonstrate how the physics of multiboson correlation interference leads to the computational complexity of linear optical interferometers based on correlation measurements in the degrees of freedom of the input bosons.
Simon Laibacher, V. Tamma
semanticscholar +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
On the complexity of computing syzygies
Journal of Symbolic Computation, 1988 \textit{G. Hermann} [Math. Ann. 95, 736-788 (1926)] gave an upper bound, double exponential in the number of variables, for the degrees of polynomials occuring in the minimal syzygies of a polynomial ideal. Here it is shown that this estimate cannot be improved and hence the complexity of computing syzygies is also double exponential.
David Bayer, Michael Stillman
openaire +1 more source
The European Physical Journal B, 2005 5 pages, 2 ...
Gonzalo Travieso +2 more
openaire +3 more sources
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
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
Computational Strategies for Dissecting the High-Dimensional Complexity of Adaptive Immune Repertoires [PDF]
Frontiers in Immunology, 2017 The adaptive immune system recognizes antigens via an immense array of antigen-binding antibodies and T-cell receptors, the immune repertoire. The interrogation of immune repertoires is of high relevance for understanding the adaptive immune response in ...
Enkelejda Miho +5 more
semanticscholar +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