An Implicit Cover Problem in Wild Population Study

An Improved Exact Algorithm for the Domatic Number Problem

An Invariance Principle for Polytopes

An omega-power of a context-free language which is Borel above Delta^0_omega

An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance

An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity

An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP

Analog models of computations \& Effective Church Turing Thesis: Efficient simulation of Turing machines by the General Purpose Analog Computer

Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem

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