Related papers: Complexity and Ramsey Largeness of Sets of Oracles…
Genetic Programming (GP) has found various applications. Understanding this type of algorithm from a theoretical point of view is a challenging task. The first results on the computational complexity of GP have been obtained for problems…
In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set…
We identify computability-theoretic properties enabling us to separate various statements about partial orders in reverse mathematics. We obtain simpler proofs of existing separations, and deduce new compound ones. This work is part of a…
For an elliptic curve $E$ over a number field $K$, one consequence of the Birch and Swinnerton-Dyer conjecture is the parity conjecture: the global root number matches the parity of the Mordell-Weil rank. Assuming finiteness of…
We are now witnessing a rapid growth of a new part of group theory which has become known as "statistical group theory". A typical result in this area would say something like ``a random element (or a tuple of elements) of a group G has a…
We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant's algebraic analog of the P not equal to NP conjecture.…
The first section starts with the basic definitions following mainly the notations of the book written by E. Kushilevitz and N. Nisan. At the end of the first section I examine tree-balancing. In the second section I summarize the…
Probabilistic independence is a useful concept for describing the result of random sampling---a basic operation in all probabilistic languages---and for reasoning about groups of random variables. Nevertheless, existing verification methods…
We develop theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence considered in program algebra is the central notion. We define counterparts of the complexity classes P/poly and…
This paper studies the computational difficulty of clustering problems that are defined directly on a continuous probability density. Rather than working with finite samples, we assume the density is given as a polynomial and ask whether it…
In this paper we investigate algebraic properties of big Ramsey degrees in categories satisfying some mild conditions. As the first nontrivial consequence of the generalization we advocate in this paper we prove that small Ramsey degrees…
We prove that if G is a sufficiently large finite almost simple group of Lie type, then given a fixed nontrivial element x in G and a coset of G modulo its socle, the probability that x and a random element of the coset generate a subgroup…
We investigate the descriptive complexity of the set of models of first-order theories. Using classical results of Knight and Solovay, we give a sharp condition for complete theories to have a $\pmb\Pi_\omega^0$-complete set of models. In…
We prove that topological isomorphism on procountable groups is not classifiable by countable structures, in the sense of descriptive set theory. In fact, the equivalence relation $\ell_\infty$ expressing that two sequences of reals have a…
Greg Hjorth and Simon Thomas proved that the classification problem for torsion-free abelian groups of finite rank \emph{strictly increases} in complexity with the rank. Subsequently, Thomas proved that the complexity of the classification…
Motivated by the problem of testing planarity and related properties, we study the problem of designing efficient {\em partition oracles}. A {\em partition oracle} is a procedure that, given access to the incidence lists representation of a…
We study the problem of identifying a probability distribution for some given randomly sampled data in the limit, in the context of algorithmic learning theory as proposed recently by Vinanyi and Chater. We show that there exists a…
We consider the first-order theory of random variables with the probabilistic independence relation, which concerns statements consisting of random variables, the probabilistic independence symbol, logical operators, and existential and…
We say that two classes of topological spaces are equivalent if each member of one class has a homeomorphic copy in the other class and vice versa. Usually when the Borel complexity of a class of metrizable compacta is considered, the class…
Pearl and Verma developed d-separation as a widely used graphical criterion to reason about the conditional independencies that are implied by the causal structure of a Bayesian network. As acyclic ground probabilistic logic programs…