Results 81 to 90 of about 378,939 (286)
Simulating counting oracles with cooperation [PDF]
We prove that monodirectional shallow chargeless P systems with active membranes and minimal cooperation working in polynomial time precisely characterise P#P k , the complexity class of problems solved in polynomial time by deterministic Turing ...
Leporati, Alberto +5 more
core
Inequalities for complex polynomials
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
MagPiezo enables wireless activation of endogenous Piezo1 channels without genetic modification using 19 nm magnetic nanoparticles and low‐intensity magnetic fields. It generates torque forces at the piconewton scale to trigger mechanotransduction in endothelial cells, standing as a novel platform to interrogate and manipulate Piezo1 activity in vitro.
Susel Del Sol‐Fernández +7 more
wiley +1 more source
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
A reconstruction theorem for complex polynomials
Recently Takens' Reconstruction Theorem was studied in the complex analytic setting by Fornæss and Peters [Complex dynamics with focus on the real part, to appear in Ergodic Theory Dynam. Syst.]. They studied the real orbits of complex polynomials, and proved that for non-exceptional polynomials ergodic properties such as measure theoretic entropy are
openaire +2 more sources
Complex polynomials in engineering
Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their evaluations are time consuming.
Benmahammed, Khier +2 more
openaire +2 more sources
This work pioneers melt electrowriting (MEW) of polyethylene vinyl acetate (PEVA) to fabricate ultra‐compliant, high‐resolution scaffolds. By integrating microscale precision with soft tissue‐like biomechanics, PEVA overcomes stiffness‐driven limitations of conventional MEW polymers, establishing a mechanically biomimetic platform for soft tissue ...
Finn Snow +9 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
Adventures in time and space [PDF]
This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its first-order programs characterize the polynomial-time computable functions, and its
Norman Danner, James S. Royer
doaj +1 more source

