Summary: We identify a formal connection between physical problems related to the detection of separable (unentangled) quantum states and complexity classes in theoretical computer science. In particular, we show that to nearly every quantum interactive proof complexity class (including $\\mathsf{BQP}...
In an edge modification problem one has to change the edge set of a given graph as little as possible so as to satisfy a certain property. We prove the NP-hardness of a variety of edge modification problems with respect to some well-studied classes of graphs. These include perfect, chordal...
The eccentric connectivity polynomial of two classes of nanotubes Wei Gao, Weifan Wang Pages 290-294 Article preview select article Effective and efficient Grassfinch kernel for SVM classification and its application to recognition based on image set Research articleAbstract only Effective and efficient ...
Bill Venners: InRefactoring, you quote Kent Beck's four criteria for a simple system: 1) Runs all the tests. 2) Reveals all the intention. 3) No duplication. 4) Fewest number of classes or methods. What is simplicity to you? Martin Fowler: I think it is difficult to come up with a...
If normal statistics acted on the velocities, the curve would look much more like a "step" function, as most of the transits would complete at around the mean, instead of getting spread out in the entropic sense. Further since the underlying exponentials describe specific classes of travel, ...
MacLean's reported on the rising role of technology entitled, New frontiers in high-tech cheating: With shrinking wireless devices, online classes and the emer- gence of wearable technology, it's easier than ever to cheat (Counter, 2014). The story highlighted escalating use of wireless ...
Contigs were assigned to a total of 191 organisms spanning different classes of the GenBank organismal division46(Table2; Supplementary TableS2). About 55% of them presented at least one contig with sequence identity (SI) > 90%, ~42% had at least one contig with SI ≥ 95% where...
The only result related to our problem that we have found in the vast amount of literature on strings (e.g. [1], [6], [13], [17], [24]) is one that does not deal with combinatorics, but rather with language classes (see Section 6 for more details). Our problem is positioned ...
Since general fan-planar drawable graphs have at most 5n−10 edges and the same bound holds for 2-planar drawable graphs [37], we investigate the relationship between these two graph classes (observe that 1-planar graphs are always fan-planar by definition). More in general, we study the...
In contrast, in the positive cosmological constant case, islands are absent in the bulk region. We take a leaf from this paper, and, using the connection between complexity and OTOC as our primary guiding principle, we reinvestigate these two particularly well-known cases from the perspective ...