Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem

Analysis of the postulates produced by Karp's Theorem

Analysis on the computability over the efficient utilization problem of the four-dimensional space-time

Another approach to the equivalence of measure-many one-way quantum finite automata and its application

Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series

Application of Support Vector Machine to detect an association between a disease or trait and multiple SNP variations

Applications of Monotone Rank to Complexity Theory

Applying Practice to Theory

Approach to solve P versus NP with Circular Founded Set

Approximability Distance in the Space of H-Colourability Problems

Approximability of Bounded Occurrence Max Ones

Approximability of Integer Programming with Generalised Constraints

Approximability of the Multiple Stack TSP

Approximate analysis of search algorithms with "physical" methods

Approximate Counting and Quantum Computation

Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems

Approximate Self-Assembly of the Sierpinski Triangle

Approximating Fixation Probabilities in the Generalized Moran Process

Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials

Approximating the partition function of the ferromagnetic Potts model