Results 11 to 20 of about 378,739 (288)
Chromatic Polynomials of Simplicial Complexes [PDF]
Graphs and Combinatorics, 2015 We consider s-chromatic polynomials of simplicial complexes, higher dimensional analogues of chromatic polynomials for graphs.
Møller, Jesper Michael, Nord, Gesche
openaire +4 more sources
Random polynomials in several complex variables
Journal d'Analyse Mathématique, 2023 This replaces and improves a previous version which has a gap in the proof of the higher codimension case at the ...
Bayraktar, Turgay +2 more
openaire +5 more sources
Stable stellar configurations with polynomial complexity factor
European Physical Journal C: Particles and Fields, 2022 In this article, we present two new families of anisotropic solutions for static spherically symmetric stellar systems by taking into account the implications of complexity factor proposed by Herrera (Phys. Rev.
M. Zubair
doaj +1 more source
Ultracompact stars with polynomial complexity by gravitational decoupling
European Physical Journal C: Particles and Fields, 2021 In this work we construct an ultracompact star configuration in the framework of Gravitational Decoupling by the Minimal Geometric Deformation approach.
M. Carrasco-Hidalgo, E. Contreras
doaj +1 more source
k-Means Has Polynomial Smoothed Complexity [PDF]
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009 The k-means method is one of the most widely used clustering algorithms, drawing its popularity from its speed in practice. Recently, however, it was shown to have exponential worst-case running time. In order to close the gap between practical performance and theoretical analysis, the k-means method has been studied in the model of smoothed analysis ...
Arthur, David +2 more
openaire +2 more sources
Polynomial Equivalence of Complexity Geometries [PDF]
QuantumThis paper proves the polynomial equivalence of a broad class of definitions of quantum computational complexity. We study right-invariant metrics on the unitary group—often called `complexity geometries' following the definition of quantum complexity ...
Adam R. Brown
doaj +1 more source
AIMS Mathematics, 2023 In this paper, we present a predictor-corrector interior-point algorithm for $ P_{*}(\kappa) $-weighted linear complementarity problems. Based on the kernel function $ \varphi(t) = \sqrt{t} $, the search direction of the algorithm is obtained.
Lu Zhang +3 more
doaj +1 more source
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length [PDF]
, 2016 We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential equations with ...
Bournez, Olivier +2 more
core +3 more sources
Complex Interpolating Polynomials [PDF]
Proceedings of the American Mathematical Society, 1988 Let I n , m ( f , z ) {I_{n,m}}\left ( {f,z} \right ) be the unique interpolatory polynomial of degree ≤ 2 n − 1
openaire +1 more source
On the Nash equilibrium in the inspector problem
Lietuvos Matematikos Rinkinys, 2014 Inspector problem represents an economic duel of inspector and law violator and is formulated as a bimatrix game. In general, bimatrix game is NP-complete problem.
Martynas Sabaliauskas, Jonas Mockus
doaj +1 more source