Results 61 to 70 of about 36,366 (263)

Counterion Dependent Side‐Chain Relaxation Stiffens a Chemically Doped Thienothiophene Copolymer

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

Complexity of Computations with Matrices and Polynomials

open access: yesSIAM Review, 1992
We review the complexity of polynomial and matrix computations, as well as their various correlations to each other and some major techniques for the design of algebraic and numerical algorithms.
openaire   +3 more sources

Polarization‐Dependent Synaptic‐Like Electro‐Optical Response in Ferroelectric Nematic Liquid Crystals

open access: yesAdvanced Functional Materials, EarlyView.
Ferroelectric nematic liquid crystals (FNLCs) offer fast, tunable polarization and low‐voltage operation but suffer from poor polarization retention at zero field. Semiconductor‐modified FNLCs enhance polarization retention and exhibit short‐ and long‐term electro‐optical responses, while also supporting spike‐type signal integrations.
Kutay Sagdic, Weiming Yao, Danqing Liu
wiley   +1 more source

A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF

open access: yesForum of Mathematics, Sigma, 2015
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

Adventures in time and space [PDF]

open access: yesLogical Methods in Computer Science, 2007
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

Two‐Photon Grayscale Lithography (2GL) of High Mechanical and Optical Quality 3D Silica Glass Microstructures

open access: yesAdvanced Functional Materials, EarlyView.
Two‐photon grayscale lithography (2GL) enables high‐speed and precise 3D printing of thermolyzed silica glass microstructures with optical‐grade surface quality, high quality factors, and mechanical strength utilizing a custom‐made pre‐glass resist based on polyhedral oligomeric silsesquioxane (POSS) modified with a high‐sensitivity Norrish type II ...
Jonathan L. G. Schneider   +4 more
wiley   +1 more source

The exact complexity of the Tutte polynomial

open access: yes, 2022
26 pages, 3 figures, 1 ...
Tomer Kotek, Johann A. Makowsky
openaire   +2 more sources

A Thermodynamic Model of Antiferroelectics and Its Application to Electric Field Induced Antiferroelectric‐Ferroelectric Transition in PbZrO3

open access: yesAdvanced Functional Materials, EarlyView.
A thermodynamic model that incorporates ferroelectric, antiferroelectric, and antiferrodistortive orders of PbZrO3${\rm PbZrO}_3$ is established and parameterized based on experimental measurements and first‐principles calculations. We derive a Clapeyron‐like equation for describing the temperature‐dependence of critical electric fields for the ...
Zhiyang Wang   +3 more
wiley   +1 more source

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

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

Home - About - Disclaimer - Privacy