Chandan Saha

发表

Lower Bounds for Sums of Products of Low arity Polynomials

Neeraj Kayal, Chandan Saha, 2015, Electron. Colloquium Comput. Complex..

Covering a Set of Points in a Plane Using Two Parallel Rectangles

Sandip Das, Chandan Saha, Sandip Das, 2007, 2007 International Conference on Computing: Theory and Applications (ICCTA'07).

An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas

Nutan Limaye, Neeraj Kayal, Srikanth Srinivasan, 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

Quasi-polynomial Hitting-set for Set-depth-Delta Formulas

Nitin Saxena, Manindra Agrawal, Chandan Saha, 2012, Electron. Colloquium Comput. Complex..

A super-polynomial lower bound for regular arithmetic formulas

Neeraj Kayal, Ramprasad Saptharishi, Chandan Saha, 2014, STOC.

Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits

Neeraj Kayal, Chandan Saha, Vineet Nair, 2020, STACS.

Multi-k-ic Depth Three Circuit Lower Bound

Neeraj Kayal, Chandan Saha, 2016, Theory of Computing Systems.

Differential Embedding and Chirikov Map based Image Watermarking in Transformed Domain

Chandan Saha, Syeda Saida Khadeeza Nawrin, 2019, 2019 International Conference on Computer, Communication, Chemical, Materials and Electronic Engineering (IC4ME2).

Average-case linear matrix factorization and reconstruction of low width algebraic branching programs

Neeraj Kayal, Chandan Saha, Vineet Nair, 2019, computational complexity.

An almost Cubic Lower Bound for Depth Three Arithmetic Circuits

Neeraj Kayal, Sébastien Tavenas, Chandan Saha, 2016, Electron. Colloquium Comput. Complex..

The Power of Depth 2 Circuits over Algebras

Nitin Saxena, Ramprasad Saptharishi, Chandan Saha, 2009, FSTTCS.

Reconstruction of Full Rank Algebraic Branching Programs

Neeraj Kayal, Sébastien Tavenas, Chandan Saha, 2018, CCC.

Lower Bounds for Sums of Powers of Low Degree Univariates

Neeraj Kayal, Pascal Koiran, Chandan Saha, 2015, ICALP.

MRI Watermarking Technique Using Chaotic Maps, NSCT and DCT

Md. Foisal Hossain, Chandan Saha, 2019, 2019 International Conference on Electrical, Computer and Communication Engineering (ECCE).

Multi-k-ic Depth Three Circuit Lower Bound

Neeraj Kayal, Chandan Saha, 2015, STACS.

Factoring Polynomials over Finite Fields using Balance Test

Chandan Saha, 2008, STACS.

On the Sum of Square Roots of Polynomials and Related Problems

Neeraj Kayal, Chandan Saha, 2011, Computational Complexity Conference.

Cellular automata based color image watermarking using NSCT and SVD

Md. Foisal Hossain, Chandan Saha, 2017, 2017 4th IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics (UPCON).

A new hybrid approach for brain tumor classification using BWT-KSVM

Chandan Saha, Md Foisal Hossain, Afsana Islam, 2017, 2017 4th International Conference on Advances in Electrical Engineering (ICAEE).

Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits

Nitin Saxena, Manindra Agrawal, Ramprasad Saptharishi, 2011, STOC '12.

Quasi-polynomial hitting-set for set-depth-Δ formulas

Nitin Saxena, Manindra Agrawal, Chandan Saha, 2012, STOC '13.

Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits

Neeraj Kayal, Chandan Saha, Vineet Nair, 2020, ACM Trans. Comput. Theory.

On the Symmetries of and Equivalence Test for Design Polynomials

Chandan Saha, Nikhil Gupta, 2019, MFCS.

On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree

Neeraj Kayal, Sébastien Tavenas, Chandan Saha, 2018, Theory Comput..

Lower Bounds for Depth-Three Arithmetic Circuits with small bottom fanin

Neeraj Kayal, Chandan Saha, 2016, computational complexity.

Lower Bounds for Depth Three Arithmetic Circuits with Small Bottom Fanin

Neeraj Kayal, Chandan Saha, 2015, Computational Complexity Conference.

Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas

Nutan Limaye, Neeraj Kayal, Srikanth Srinivasan, 2014, STOC.

On the symmetries of design polynomials

Nikhil Gupta, Chandan Saha, 2018, Electron. Colloquium Comput. Complex..

Fast integer multiplication using modular arithmetic

Anindya De, Ramprasad Saptharishi, Piyush P. Kurur, 2008, STOC.

An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas

Nutan Limaye, Neeraj Kayal, Srikanth Srinivasan, 2017, SIAM J. Comput..

Reconstruction of non-degenerate homogeneous depth three circuits

Neeraj Kayal, Chandan Saha, N. Kayal, 2019, Electron. Colloquium Comput. Complex..

MRI brain tumor images classification using K-means clustering, NSCT and SVM

Md. Foisal Hossain, Chandan Saha, 2017, 2017 4th IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics (UPCON).

Determinant equivalence test over finite fields and over ℚ

Ankit Garg, Neeraj Kayal, Nikhil Gupta, 2019, Electron. Colloquium Comput. Complex..

Guest Column: A Paradigm for Arithmetic Circuit Lower Bounds

Neeraj Kayal, Chandan Saha, 2018, SIGA.

Simpler algorithm for estimating frequency moments of data streams

Sumit Ganguly, Deepanjan Kesh, Chandan Saha, 2006, SODA '06.

Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits

Nitin Saxena, Manindra Agrawal, Ramprasad Saptharishi, 2016, SIAM J. Comput..

On the Sum of Square Roots of Polynomials and Related Problems

Neeraj Kayal, Chandan Saha, N. Kayal, 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

On the size of homogeneous and of depth four formulas with low individual degree

Neeraj Kayal, Sébastien Tavenas, Chandan Saha, 2015, STOC.

Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant pdf

Neeraj Kayal, Rajat Mittal, Michael A. Forbes, 2011, ArXiv.

Brain Tumor Classification and Watermarking of MRI Using Nonsubsampled Contourlet Transform

Chandan Saha, 2018 .

Reconstruction of Full Rank Algebraic Branching Programs

Neeraj Kayal, Sébastien Tavenas, Chandan Saha, 2017, Computational Complexity Conference.

Practical Algorithms for Tracking Database Join Sizes

Sumit Ganguly, Deepanjan Kesh, Chandan Saha, 2005, FSTTCS.

Fast Integer Multiplication Using Modular Arithmetic

Anindya De, Ramprasad Saptharishi, Piyush P. Kurur, 2013, SIAM J. Comput..

Integer Wavelet Transform Based Medical Image Watermarking for Tamper Detection

Md. Foisal Hossain, Chandan Saha, Tanjil Alam Tarmal, 2019, 2019 International Conference on Electrical, Computer and Communication Engineering (ECCE).

A Case of Depth-3 Identity Testing, Sparse Factorization and Duality

Nitin Saxena, Ramprasad Saptharishi, Chandan Saha, 2013, computational complexity.

Integer Wavelet Transform based Dual Watermarking Technique using Tent Map and Local Binary Pattern

Md. Foisal Hossain, Chandan Saha, Sumaya Rahman, 2018 .

Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness -

Chandan Saha, Sandip Sinha, 2014 .

Determinant equivalence test over finite fields and over ℚ

Ankit Garg, Neeraj Kayal, Nikhil Gupta, 2019, Electron. Colloquium Comput. Complex..

Covering a Set of Points in a Plane Using Two Parallel Rectangles

Sandip Das, Chandan Saha, 2007, ICCTA.

Learning generalized depth-three arithmetic circuits in the non-degenerate case

Ankit Garg, Neeraj Kayal, Chandan Saha, 2021, Electron. Colloquium Comput. Complex..

Hitting Sets for Orbits of Circuit Classes and Polynomial Families

Chandan Saha, Bhargav Thankey, Chandan Saha, 2021, Electron. Colloquium Comput. Complex..