Complexity and Approximation for Discriminating Code Problems in Geometric Setups
Complexity and Approximation for Discriminating Code Problems in Geometric Setups
Subhas Chandra Nandy
Professor
Advanced Computing & Microelectronics Unit
Indian Statistical Institute, Kolkata
ABSTRACT