Results 81 to 90 of about 378,739 (288)
Efficient Charge Transport in Zero‐Dimensional Perovskite for Ultrahigh‐Sensitivity X‐Ray Detection
A novel mono‐octahedral 0D Bi‐based Dpy3Bi2I12 perovskite strengthens the internal hydrogen bonds and forms a quasi‐2D lattice, exhibits exceptional charge transport and mobility, achieving high X‐ray sensitivity and ultralow‐dose imaging, and setting a new benchmark for 0D detector performance.
Xin Song +16 more
wiley +1 more source
A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF
We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations.
FELIPE CUCKER
doaj +1 more source
This study introduces an innovative approach to treating intervertebral disc degeneration using ultrasound‐triggered in situ hydrogel formation. Proof‐of‐concept experiments using optimized biomaterial and ultrasound parameters demonstrate partial restoration of biomechanical function and successful integration into degenerated disc tissue, offering a ...
Veerle A. Brans +11 more
wiley +1 more source
The tractability frontier of well-designed SPARQL queries
We study the complexity of query evaluation of SPARQL queries. We focus on the fundamental fragment of well-designed SPARQL restricted to the AND, OPTIONAL and UNION operators.
Abiteboul S. +6 more
core +1 more source
AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
Measuring the complexity of directed graphs: A polynomial-based approach.
In this paper, we define novel graph measures for directed networks. The measures are based on graph polynomials utilizing the out- and in-degrees of directed graphs. Based on these polynomial, we define another polynomial and use their positive zeros as
Matthias Dehmer +8 more
doaj +1 more source
Complexity Lower Bound for Boolean Functions in the Class of Extended Operator Forms
Starting with the fundamental work of D.E.Muller in 1954, the polynomial representations of Boolean functions are widely investigated in connection with the theory of coding and for the synthesis of circuits of digital devices.
A.S. Baliuk
doaj +1 more source
Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime [PDF]
The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are known to map ...
Kawamura, Akitoshi +3 more
core
Magnetic doping of the topological insulator Bi2Te3 with erbium adatoms induces out‐of‐plane magnetism and breaks time‐reversal symmetry, opening a Dirac gap and driving a Fermi surface transition from hexagonal to star‐of‐David geometry. Microscopy, spectroscopy, and magnetic dichroism reveal atomically controlled magnetic interactions that tailor the
Beatriz Muñiz Cano +18 more
wiley +1 more source
The representations, including polynomial, of functions over final fields have been actively investigated. The complexity of such representations is the main stream of research.
A. Baliuk, A.S. Zinchenko
doaj

