Results 71 to 80 of about 378,939 (286)
Improving the smoothed complexity of FLIP for max cut problems
, 2018 Finding locally optimal solutions for max-cut and max-$k$-cut are well-known PLS-complete problems. An instinctive approach to finding such a locally optimum solution is the FLIP method. Even though FLIP requires exponential time in worst-case instances,
Bibak, Ali +2 more
core +1 more source
Matrix cyclization over complex polynomials
Linear Algebra and its Applications, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The complex zeros of random polynomials [PDF]
Transactions of the American Mathematical Society, 1995 Mark Kac gave an explicit formula for the expectation of the number, ν n ( Ω ) {\nu _n}(\Omega ) , of zeros of a random polynomial, \[ P n ( z ) = ∑
Shepp, Larry A, Vanderbei, Robert J
openaire +3 more sources
Cardiac‐Derived ECM Microspheres for Enhanced hiPSC‐CMs Maturation
Advanced Functional Materials, EarlyView.Cardiac extracellular matrix microspheres derived from decellularized porcine heart provide a biomimetic 3D microenvironment for human induced pluripotent stem cell–derived cardiomyocytes (hiPSC‐CMs). This platform supports short‐ and long‐term culture, enhances structural organization, and promotes electrophysiological and functional maturation of ...
Jiazhu Xu +9 more
wiley +1 more source
On Upper Bound of the Complexity of Quasi Polynomial Representations of Functions over Finite Fields
Известия Иркутского государственного университета: Серия "Математика", 2014 Representations of functions over finite fields, including polynomial representations, are being actively investigated. The complexity of such representations is one of main directions of research.
A.S. Baliuk
doaj
On computational complexity of Siegel Julia sets
, 2005 It has been previously shown by two of the authors that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification.
Binder, I., Braverman, M., Yampolsky, M.
core +1 more source
Counterion Dependent Side‐Chain Relaxation Stiffens a Chemically Doped Thienothiophene Copolymer
Advanced Functional Materials, EarlyView.Oxidation of a thienothiophene copolymer, p(g3TT‐T2), via different doping strategies and dopant molecules resulted in materials with similar oxidation levels and a high electrical conductivity of ≈100 S cm−1. However, mechanical properties varied significantly, with sub‐glass transition temperatures and elastic moduli spanning from –44°C to –3°C and ...
Mariavittoria Craighero +12 more
wiley +1 more source
Известия Иркутского государственного университета: Серия "Математика", 2016 Recently, the interest to polynomial representations of functions over finite fields and over finite rings is being increased. Complexity of those representations is widely studied.
A. Kazimirov, S. Reymerov
doaj
Chebyshev Polynomials and Generalized Complex Numbers [PDF]
Advances in Applied Clifford Algebras, 2013 The generalized complex numbers can be realized in terms of $2\times2$ or higher-order matrices and can be exploited to get different ways of looking at the trigonometric functions. Since Chebyshev polynomials are linked to the power of matrices and to trigonometric functions, we take the quite natural step to discuss them in the context of the theory ...
Babusci, D. +3 more
openaire +3 more sources
Imaging of Biphoton States: Fundamentals and Applications
Advanced Functional Materials, EarlyView.Quantum states of two photons exhibit a rich polarization and spatial structure, which provides a fundamental resource of strongly correlated and entangled states. This review analyzes the physics of these intriguing properties and explores the various techniques and technologies available to measure them, including the state of the art of their ...
Alessio D'Errico, Ebrahim Karimi
wiley +1 more source