cseiitgn
14 SlideShares
Tags
nmi-workshop-2016
See more

Presentations

(14)
See all

Complexity Classes and the Graph Isomorphism Problem

8 years ago • 387 Views

Efficiently decoding Reed-Muller codes from random errors

8 years ago • 666 Views

Space-efficient Approximation Scheme for Maximum Matching in Sparse Graphs

8 years ago • 101 Views

Topology Matters in Communication

8 years ago • 89 Views

Solving connectivity problems via basic Linear Algebra

8 years ago • 98 Views

Color Coding-Related Techniques

8 years ago • 295 Views

Unbounded Error Communication Complexity of XOR Functions

8 years ago • 135 Views

Isolation Lemma for Directed Reachability and NL vs. L

8 years ago • 140 Views

The Chasm at Depth Four, and Tensor Rank : Old results, new insights

8 years ago • 100 Views

Hardness of multiple choice problems

8 years ago • 102 Views

Space-efficient Approximation Scheme for Maximum Matching in Sparse Graphs

8 years ago • 204 Views

Dynamic Parameterized Problems - Algorithms and Complexity

8 years ago • 327 Views

Alternate Parameterizations

8 years ago • 80 Views

A Quest for Subexponential Time Parameterized Algorithms for Planar-k-Path: From Undirected to Directed

8 years ago • 359 Views
Tags
nmi-workshop-2016
See more