Improved Exponential Time Lower Bound of Knapsack Problem under BT model

Improved hardness results for unique shortest vector problem

Improved Inapproximability For Submodular Maximization

Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model

Improved Inapproximability Results for Maximum k-Colorable Subgraph

Improved Lower Bounds for the Shortest Superstring and Related Problems

Improved Monotone Circuit Depth Upper Bound for Directed Graph Reachability

Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization

Inapproximability of Combinatorial Optimization Problems

Inapproximability of maximal strip recovery

Inapproximability of Maximum Weighted Edge Biclique and Its Applications

Inapproximability of NP-Complete Variants of Nash Equilibrium

Inapproximability of the Tutte polynomial

Inapproximability of the Tutte polynomial of a planar graph

Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems

Inclusion of Unambiguous RE#s is NP-Hard

Independence of P vs. NP in regards to oracle relativizations

Independence Properties of Algorithmically Random Sequences

Independent sets in random graphs from the weighted second moment method

Individual Communication Complexity