Results 71 to 80 of about 381,752 (282)
Simulating counting oracles with cooperation [PDF]
, 2019 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
On the Complexity of the Generalized MinRank Problem
, 2013 We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$.
Din, Mohab Safey El +2 more
core +3 more sources
The Complexity of Factors of Multivariate Polynomials [PDF]
Foundations of Computational Mathematics, 2001 This is an updated version of a paper published in J. FoCM in 2004.
openaire +3 more sources
Predicting Atomic Charges in MOFs by Topological Charge Equilibration
Advanced Functional Materials, EarlyView.An atomic charge prediction method is presented that is able to accurately reproduce ab‐initio‐derived reference charges for a large number of metal–organic frameworks. Based on a topological charge equilibration scheme, static charges that fulfill overall neutrality are quickly generated.
Babak Farhadi Jahromi +2 more
wiley +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
A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF
Forum 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]
Logical 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
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
Multiplex Modular Nanorobotic Systems with Catalytic Activity under Magnetic Navigation
Advanced Functional Materials, EarlyView.We present modular nanorobots composed of a magnetic propulsion module and different extension modules carrying functional activities, assembled via DNA base pairing. The system integrates propulsion, optical tracking, enzymatic catalysis, and cell docking in a programmable manner.
Voichita Mihali +7 more
wiley +1 more source
Measuring the complexity of directed graphs: A polynomial-based approach.
PLoS 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