Results 21 to 30 of about 1,395,371 (292)
The computational complexity of PEPS [PDF]
, 2006 We determine the computational power of preparing Projected Entangled Pair States (PEPS), as well as the complexity of classically simulating them, and generally the complexity of contracting tensor networks.
A. Y. Kitaev +9 more
core +3 more sources
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing [PDF]
TheoretiCS, 2022 A graph $G$ is called self-ordered (a.k.a asymmetric) if the identity permutation is its only automorphism. Equivalently, there is a unique isomorphism from $G$ to any graph that is isomorphic to $G$. We say that $G=(V,E)$ is robustly self-ordered if the
Oded Goldreich, Avi Wigderson
doaj +1 more source
The Computational Complexity of Linear Optics [PDF]
, 2010 We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical computers.
Aaronson, Scott, Arkhipov, Alex
core +5 more sources
Entropy, 2017 Complex systems (CS) involve many elements that interact at different scales in time and space. The challenges in modeling CS led to the development of novel computational tools with applications in a wide range of scientific areas.
J. A. Tenreiro Machado +1 more
doaj +1 more source
Frontiers in Immunology, 2018 Alkaline phosphatase (AP) is an enzyme that exhibits anti-inflammatory effects by dephosphorylating inflammation triggering moieties (ITMs) like bacterial lipopolysaccharides and extracellular nucleotides. AP administration aims to prevent and treat peri-
Alva Presbitero +8 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
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
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