Related papers: Computational Complexity of Smooth Differential Eq…
We show that the question about the criterion of a singularity formation for radially symmetric solutions to the Cauchy problem for a fairly wide class of equations related to the pressureless Euler-Poisson equations can be reduced to the…
We study maximal families W of the Hilbert scheme, H(d,g)_{sc}, of smooth connected space curves whose general curve C lies on a smooth surface S of degree s. We give conditions on C under which W is a generically smooth component of…
It is important to design separation algorithms of low computational complexity in mixed integer programming. We study the separation problems of the two continuous knapsack polyhedra with divisible capacities. The two polyhedra are the…
We note the significance of hypergraphic planted clique (HPC) detection in the investigation of computational hardness for a range of tensor problems. We ask if more evidence for the computational hardness of HPC detection can be developed.…
Let $M$ be a compact 1-manifold. Given a continuous function $g:M\to \mathbb R_+$ we consider the following ordinary differential equation: $\|\dot{f}(t)\|=g(t)$, where $f:M\to \mathbb R^2$. We construct a probability measure on the space…
We study the complexity of reasoning in abstracts argumentation frameworks close to graph classes that allow for efficient reasoning methods, i.e.\ to one of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we show…
Let $S$ be a smooth projective surface with $p_g=q=0$. We show how to use derived categorical methods to study the geometry of certain special iterated Hilbert schemes associated to $S$ by showing that they contain a smooth connected…
We leverage path differentiability and a recent result on nonsmooth implicit differentiation calculus to give sufficient conditions ensuring that the solution to a monotone inclusion problem will be path differentiable, with formulas for…
These notes contain, among others, a proof that the average running time of an easy solution to the satisfiability problem for propositional calculus is, under some reasonable assumptions, linear (with constant 2) in the size of the input.…
We survey the average-case complexity of problems in NP. We discuss various notions of good-on-average algorithms, and present completeness results due to Impagliazzo and Levin. Such completeness results establish the fact that if a certain…
We derive second order estimates for $\chi$-plurisubharmonic solutions of complex Hessian equations with right hand sides depending on gradients on compact Hermitian manifolds.
Given a graph G, we investigate the question of determining the parity of the number of homomorphisms from G to some other fixed graph H. We conjecture that this problem exhibits a complexity dichotomy, such that all parity graph…
We study linear equations in combinatorial Laplacians of $k$-dimensional simplicial complexes ($k$-complexes), a natural generalization of graph Laplacians. Combinatorial Laplacians play a crucial role in homology and are a central tool in…
We study the homogeneous elliptic systems of order $2\ell$ with real constant coefficients on Lipschitz domains in $R^n$, $n\ge 4$. For any fixed $p>2$, we show that a reverse H\"older condition with exponent $p$ is necessary and sufficient…
This manuscript explores novel complexity results for the feasibility problem over $p$-order cones, extending the foundational work of Porkolab and Khachiyan. By leveraging the intrinsic structure of $p$-order cones, we derive refined…
Let g be a cubic polynomial with integer coefficients and n>9 variables, and assume that the congruence g=0 modulo p^k is soluble for all prime powers p^k. We show that the equation g=0 has infinitely many integer solutions when the cubic…
The well-known sequentially lifted cover inequality is widely employed in solving mixed integer programs. However, it is still an open question whether a sequentially lifted cover inequality can be computed in polynomial time for a given…
We examine the computational complexity of testing and finding small plans in probabilistic planning domains with both flat and propositional representations. The complexity of plan evaluation and existence varies with the plan type sought;…
Let $(X,\omega)$ be an $n$-dimensional compact K\"{a}hler manifold. We study degenerate complex Hessian equations of the form $(\omega+dd^c\varphi)^m\wedge \omega^{n-m}=F(x,\varphi)\omega^n.$ Under some natural conditions on $F$, this…
The computation of Gr\"obner bases is an established hard problem. By contrast with many other problems, however, there has been little investigation of whether this hardness is robust. In this paper, we frame and present results on the…