On the Computational Complexity of Satisfiability Solving for String Theories
On the computational complexity of spiking neural P systems
On the computational complexity of stochastic controller optimization in POMDPs
On the Computational Complexity of the Forcing Chromatic Number
On the Continuity Set of an omega Rational Function
On the Distribution of the Fourier Spectrum of Halfspaces
On the Double Coset Membership Problem for Permutation Groups
On the Dynamic Qualitative Behaviour of Universal Computation
On the equivalence between minimal sufficient statistics, minimal typical models and initial segments of the Halting sequence
On the Feasibility of Maintenance Algorithms in Dynamic Graphs
On the Furthest Hyperplane Problem and Maximal Margin Clustering
On the Geometry of Differential Privacy
On the graph isomorphism problem
On the hardness of distinguishing mixed-state quantum computations
On the hardness of the noncommutative determinant
On the Hidden Shifted Power Problem
On the injectivity of the global function of a cellular automaton in the hyperbolic plane (extended abstract)
On the intrinsic complexity of elimination problems in effective Algebraic Geometry
On the Kolmogorov-Chaitin Complexity for short sequences
On The Liniar Time Complexity of Finite Languages