ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Browse by Journal / Conference

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 3.

Kayal, Neeraj and Nair, Vineet and Saha, Chandan (2019) Average-case linear matrix factorization and reconstruction of low width algebraic branching programs. In: COMPUTATIONAL COMPLEXITY, 28 (4). pp. 749-828.

Kayal, Neeraj and Saha, Chandan (2016) LOWER BOUNDS FOR DEPTH-THREE ARITHMETIC CIRCUITS WITH SMALL BOTTOM FANIN. In: COMPUTATIONAL COMPLEXITY, 25 (2). pp. 419-454.

Bhattacharyya, Arnab and Xie, Ning (2015) Lower bounds for testing triangle-freeness in Boolean functions. In: COMPUTATIONAL COMPLEXITY, 24 (1). pp. 65-101.

This list was generated on Wed Nov 13 17:30:47 2024 IST.