Results 71 to 80 of about 2,555,427 (286)
Polynomial - time algorithms for the factorization of polynomials.
Bull. EATCS, 1984 In 1982 a polynomial-time algorithm for factoring polynomials in one variable with rational coefficients was published (see A.K. Lenstra, H.W. Lenstra, Jr. and L. Lovasz, Math. Ann., vol.261, p.515-34, 1982). This L3-algorithm came as a rather big surprise: hardly anybody expected that the problem allowed solution in polynomial time.
openaire +4 more sources
Advanced Materials, EarlyView.Intrinsic material dynamics are harnessed as computational resources for neuromorphic in‐materio physical reservoir computing. Defects, ionic motion, interfaces, percolation, geometry, and biasing shape transient states that provide fading memory, nonlinearity, and high‐dimensional projection for simple readout. A descriptor‐to‐dynamics framework links
Kshitij RB Singh +5 more
wiley +1 more source
Algorithmic Properties of Polynomial Rings
Journal of Symbolic Computation, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Improved algorithms for isomorphisms of polynomials [PDF]
, 1998 This paper is about the design of improved algorithms to solve Isomorphisms of Polynomials (IP) problems. These problems were first explicitly related to the problem of finding the secret key of some asymmetric cryptographic algorithms (such as Matsumoto and Imai's C* scheme of [12], or some variations of Patarin's HFE scheme of [14]). Moreover, in [14]
Jacques Patarin +2 more
openaire +2 more sources
Ionic Gating of Liquid‐Crystal‐Like Pteridine Assemblies Enables Tunable Light Scattering
Advanced Materials, EarlyView.Tunable optical properties emerge through developmentally regulated ionic gating, which transforms disordered, ultraviolet (UV)‐absorbing organelles into concentrically ordered, liquid‐crystal‐like light scatterers. By integrating analyses of pteridine composition, potassium‐dependent assembly, hierarchical ultrastructure, and optical behavior, the ...
Sourabh Bera +22 more
wiley +1 more source
Fast algorithms for the characteristics polynomial
Theoretical Computer Science, 1985 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The Medusa algorithm for polynomial matings
Conformal Geometry and Dynamics of the American Mathematical Society, 2012 The Medusa algorithm takes as input two postcritically finite quadratic polynomials and outputs the quadratic rational map which is the mating of the two polynomials (if it exists). Specifically, the output is a sequence of approximations for the parameters of the rational map, as well as an image of its Julia set. Whether these approximations converge
Boyd, Suzanne Hruska +1 more
openaire +3 more sources
Inverse Design of Nanoparticulate Materials
Advanced Materials, EarlyView.Inverse design shifts nanomaterial development from empirical trial‐and‐error to predictive model‐driven strategies. It can rely on knowledge‐based, data‐based, or hybrid process and property functions. This perspective article provides a practical framework for applying inverse design based on instructive examples. It discusses which modeling approach
Nabi Etienne Traoré +5 more
wiley +1 more source
A Polynomial Optimization Approach to Constant Rebalanced Portfolio Selection [PDF]
We address the multi-period portfolio optimization problem with the constant rebalancing strategy. This problem is formulated as a polynomial optimization problem (POP) by using a mean-variance criterion.
Sotirov, R., Takano, Y.
core
Advanced Materials Technologies, EarlyView.Single‐filament material extrusion enables spatial stiffness programming through locally controlled thermal foaming of TPU. A data‐driven G‐code framework tunes porosity from 15.7% to 40.7% and hardness from 90 to 63 Shore A within and across layers. Monolithic hands and soft actuators consequently achieve distinct programmed motions without material ...
Rosanna Rifino +3 more
wiley +1 more source