Results 61 to 70 of about 1,907,337 (239)

Measuring the complexity of directed graphs: A polynomial-based approach.

open access: yesPLoS ONE, 2019
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

Resistance to Overdoping Allows Over 2000 S cm−1 Conductivity in P(g3BTTT) With Anion‐Exchange Doping

open access: yesAdvanced Materials, EarlyView.
Anion‐exchange doping of conjugated polymers is an effective way to achieve high conductivities. Here, we report over 2000 S cm−1 electrical conductivity for doped P(g3BTTT). In addition, we show that P(g3BTTT) sustains exceptionally high doping levels without any drop in the charge mobility.
Basil Hunger   +14 more
wiley   +1 more source

Complexity Lower Bound for Boolean Functions in the Class of Extended Operator Forms

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2019
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

Ionic Gating of Liquid‐Crystal‐Like Pteridine Assemblies Enables Tunable Light Scattering

open access: yesAdvanced 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

Lower Bound of the Complexity of Functions over Finite Field of Order 4 in the Class of Polarized Polynomials

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2016
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  

On the Complexity of Optimization over the Standard Simplex [PDF]

open access: yes
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube.In addition, we show that there exists a polynomial time approximation scheme (PTAS) for minimizing Lipschitz continuous functions and functions with ...
Klerk, E. de   +2 more
core  

Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization [PDF]

open access: yes, 2018
International audienceMulti-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the ...
Mohab Safey El Din   +3 more
core   +1 more source

Epitaxially Integrated Electro‐Optic KNbO3 Thin Films on Silicon

open access: yesAdvanced Materials, EarlyView.
We demonstrate the first epitaxial integration of electro‐optic KNbO3 thin films on silicon using suboxide molecular‐beam epitaxy. Combining adsorption‐controlled molecular‐beam epitaxy, advanced characterization, and phase‐field modeling, we demonstrate phase‐pure crystalline films mirroring bulk crystals with robust Pockels response, enabling future ...
Sankalpa Hazra   +17 more
wiley   +1 more source

Quantum Signal Processing and Quantum Singular Value Transformation on $U(N)$ [PDF]

open access: yesQuantum
Quantum signal processing and quantum singular value transformation are powerful tools to implement polynomial transformations of block-encoded matrices on quantum computers, and has achieved asymptotically optimal complexity in many prominent quantum ...
Xi Lu, Yuan Liu, Hongwei Lin
doaj   +1 more source

Quantum-inspired algorithm for general minimum conical hull problems

open access: yesPhysical Review Research, 2020
A wide range of fundamental machine learning tasks that are addressed by the maximum a posteriori estimation can be reduced to a general minimum conical hull problem.
Yuxuan Du   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy