Results 101 to 110 of about 3,634,484 (348)
About some exponential inequalities related to the sinc function
Journal of Inequalities and Applications, 2018 In this paper, we prove some exponential inequalities involving the sinc function. We analyze and prove inequalities with constant exponents and inequalities with certain polynomial exponents. Also, we establish intervals in which these inequalities hold.
Marija Rašajski +2 more
doaj +1 more source
An Algorithmic Metatheorem for Directed Treewidth [PDF]
, 2015 The notion of directed treewidth was introduced by Johnson, Robertson, Seymour and Thomas [Journal of Combinatorial Theory, Series B, Vol 82, 2001] as a first step towards an algorithmic metatheory for digraphs.
Oliveira, Mateus de Oliveira
core
A Dichotomy Theorem for Homomorphism Polynomials
, 2012 In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H.
A.A. Bulatov +8 more
core +1 more source
Projection constants for spaces of Dirichlet polynomials
Mathematische AnnalenarXiv admin note: substantial text overlap with arXiv:2208 ...
A. Defant +4 more
openaire +3 more sources
Rapid Deep Vat Printing Using Photoclickable Collagen‐Based Bioresins
Advanced Healthcare Materials, EarlyView.Collagen‐based resin formulations based on thiol‐ene photoclick chemistry are demonstrated. These resins enable easy handleability under neutral conditions and further allow facile fabrication of multicellular tissue constructs via tomographic or FLight printing.
Michael Winkelbauer +8 more
wiley +1 more source
Municipal Insolvency: The New Chapter IX of the Bankruptcy Act [PDF]
, 1977 In this report we give an introduction to a constructive way of treating systems of polynomial equations and inequalities. We present a method called cylindrical algebraic decomposition (CAD) discovered 1973 by Collins.
King, Lawrence P.
core +1 more source
A Basis for Polynomial Solutions to Systems of Linear Constant Coefficient PDE's
, 1996 LetKrepresent either the real or the complex numbers. LetPk,k=1, 2, …, rbe constant coefficient (with coefficients fromk) polynomials innvariables and letN⩽M={u(x)∈K[x]⩽M∣Pk(∂/∂x1, …, ∂/∂xn) u(x)=0;k=1, 2, …, rbe the set of all polynomial solutions (of ...
Paul Pedersen
semanticscholar +1 more source
Relating polynomial time to constant depth
Theoretical Computer Science, 1998 AbstractGoing back to the seminal paper of Furst, Saxe, and Sipser (1984), analogues between polynomial time classes and constant depth circuit classes have been considered in a number of papers. Oracles separating polynomial time classes have been obtained by diagonalization making essential use of lower bounds for circuit classes.
openaire +1 more source
Advanced Healthcare Materials, EarlyView.AIMSPec‐LoC is a novel lab‐on‐a‐chip platform integrating size‐based extracellular vesicle (EVs) separation with label‐free Raman spectroscopy and AI‐powered classification via SKiNET. This high‐throughput, portable system enables real‐time, multiplexed molecular fingerprinting of EVs from biofluids, offering transformative potential for early, non ...
Emma Buchan +3 more
wiley +1 more source
On some constants in simultaneous approximation
International Journal of Mathematics and Mathematical Sciences, 1995 Pointwise estimates for the error which is feasible in simultaneous approximation of a function and its derivatives by an algebraic polynomial were originally pursued from theoretical motivations, which did not immediately require the estimation of the ...
K. Balázs, T. Kilgore
doaj +1 more source