Related papers: Prime Factoring and The Complexity Of
We initiate a program of parameterized proof complexity that aims to provide evidence that FPT is different from W[1]. A similar program already exists for the classes W[2] and W[SAT]. We contrast these programs and prove upper and lower…
The aim of this paper is to study the probability that the commutator of an arbitrarily chosen pair of elements, each from two different subrings of a finite non-commutative ring equals a given element of that ring. We obtain several…
Attempts to replicate probabilistic reasoning in expert systems have typically overlooked a critical ingredient of that process. Probabilistic analysis typically requires extensive judgments regarding interdependencies among hypotheses and…
The likelihood function plays a pivotal role in statistical inference; it is adaptable to a wide range of models and the resultant estimators are known to have good properties. However, these results hinge on correct specification of the…
Conceptual combination performs a fundamental role in creating the broad range of compound phrases utilized in everyday language. This article provides a novel probabilistic framework for assessing whether the semantics of conceptual…
Recent studies showed that hardness, a complex property, can be calculated using very simple approaches or even analytical formulae. These form the basis for evaluating controversial experimental results (as we illustrate for…
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…
There was proposed the method of a factorization of PDE. The method is based on reduction of complicated systems to more easy ones (for example, due to dimension decrease). This concept is proposed in general case for the arbitrary PDE…
In this paper we discusses the relationship between the known classes P and NP. We show that the difficulties in solving problem "P versus NP" have methodological in nature. An algorithm for solving any problem is sensitive to even small…
Factor models are a very efficient way to describe high dimensional vectors of data in terms of a small number of common relevant factors. This problem, which is of fundamental importance in many disciplines, is usually reformulated in…
We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…
A formula is presented for the determinant of the second additive compound of a square matrix in terms of coefficients of its characteristic polynomial. This formula can be used to make claims about the eigenvalues of polynomial matrices,…
Form factor axioms are derived in two dimensional integrable defect theories for matrix elements of operators localized both in the bulk and on the defect. The form factors of bulk operators are expressed in terms of the bulk form factors…
Presently flow and nonflow cannot be separated experimentally. Using Pythia simulations of p+p collisions we show that nonflow approximately factorizes. This fact may be used to disentangle flow and nonflow in heavy ion data by performing a…
Reasoning with defeasible and conflicting knowledge in an argumentative form is a key research field in computational argumentation. Reasoning under various forms of uncertainty is both a key feature and a challenging barrier for automated…
The problem of simplicity of Fermat number-twins $f_{n}^{\pm}=2^{2^n}\pm3$ is studied. The question for what $n$ numbers $f_{n}^{\pm}$ are composite is investigated. The factor-identities for numbers of a kind $x^2 \pm k $ are found.
We generalize the classical lifting and recombination scheme for rational and absolute factorization of bivariate polynomials to the case of a critical fiber. We explore different strategies for recombinations of the analytic factors,…
We show that the problem of determining the feasibility of quadratic systems over $\mathbb{C}$, $\mathbb{R}$, and $\mathbb{Z}$ requires exponential time. This separates P and NP over these fields/rings in the BCSS model of computation.
We apply general difference calculus in order to obtain solutions to the functional equations of the second order. We show that factorization method can be successfully applied to the functional case. This method is equivariant under the…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…