( en | de | ru )

 

Disambiguation of "Saxena, Nitin"

Author of the publication

copydeleteadd this publication to your clipboard
Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs.

, , , and . Computational Complexity Conference, volume 33 of LIPIcs, page 323-346. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Abhinav Saxena

Sirin Nitinawarat

Nitin Nangare

Nitin Suresh

Nitin Jain

 

Other publications of authors with the same name

Modified valence aware dictionary for sentiment reasoning classifier for detection and classification of Covid-19 related rumors from social media data streams., , and . Concurr. Comput. Pract. Exp., (2022)Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good., , , and . Electron. Colloquium Comput. Complex., (2017)Hitting-sets for low-distance multilinear depth-3., , , and . Electron. Colloquium Comput. Complex., (2013)Hitting-sets for ROABP and Sum of Set-Multilinear circuits., , , and . Electron. Colloquium Comput. Complex., (2014)An efficient fragile watermarking scheme for tamper localization in satellite images., , and . Comput. Electr. Eng., 109 (Part B): 108783 (August 2023)Diagonal Circuit Identity Testing and Lower Bounds.. Algebraic Methods in Computational Complexity, volume 07411 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2007)The Power of Depth 2 Circuits over Algebras., , and . FSTTCS, volume 4 of LIPIcs, page 371-382. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)Discovering the roots: uniform closure results for algebraic classes under factoring., , and . STOC, page 1152-1165. ACM, (2018)Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits., and . FOCS, page 200-211. IEEE, (2022)Equivalence of F-Algebras and Cubic Forms., and . STACS, volume 3884 of Lecture Notes in Computer Science, page 115-126. Springer, (2006)