Results 21 to 30 of about 1,450,191 (282)
Computational complexity of μ calculation [PDF]
, 1993 The structured singular value μ measures the robustness of uncertain systems. Numerous researchers over the last decade have worked on developing efficient methods for computing μ.
Braatz, Richard P. +3 more
core +3 more sources
Computational Power Evaluation for Energy-Constrained Wireless Communications Systems
IEEE Open Journal of the Communications Society, 2020 Estimating the power consumption and computational complexity of various digital signal processing (DSP) algorithms used in wireless communications systems is critical to assess the feasibility of implementing such algorithms in hardware, and for ...
Maryam Tariq +4 more
doaj +1 more source
Molecular mechanisms of multi-omic regulation in breast cancer
Frontiers in Oncology, 2023 Breast cancer is a complex disease that is influenced by the concurrent influence of multiple genetic and environmental factors. Recent advances in genomics and other high throughput biomolecular techniques (-omics) have provided numerous insights into ...
Soledad Ochoa +3 more
doaj +1 more source
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
Computational Complexity in Electronic Structure [PDF]
, 2012 In quantum chemistry, the price paid by all known efficient model chemistries is either the truncation of the Hilbert space or uncontrolled approximations.
Aaronson +80 more
core +3 more sources
Physical portrayal of computational complexity [PDF]
, 2009 Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because many natural processes have been recognized to complete in
Annila, Arto
core +2 more sources
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
INFORMATION-THEORETIC COMPUTATIONAL COMPLEXITY [PDF]
IEEE Transactions on Information Theory, 1974 This paper attempts to describe, in nontechnical language, some of the concepts and methods of one school of thought regarding computational complexity. It applies the viewpoint of information theory to computers. This will first lead us to a definition of the degree of randomness of individual binary strings, and then to an information-theoretic ...
openaire +1 more source
Quantum implicit computational complexity
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dal Lago U. +2 more
openaire +3 more sources
Reversible computing and implicit computational complexity
Science of Computer Programming, 2022 Abstract We argue that there is a link between implicit computational complexity theory and reversible computation. We introduce inherently reversible programming languages which capture the complexity classes etime and . Furthermore, we discuss and analyze higher-order versions of our reversible programming languages.
openaire +3 more sources