( en | de | ru )

 

Disambiguation of "Saxena, Nitin"

Author of the publication

copydeleteadd this publication to your clipboard
A nature inspired hybrid optimisation algorithm for dynamic environment with real parameter encoding.

, , , and . Int. J. Bio Inspired Comput., 10 (1): 24-32 (2017)

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

Discovering the roots: uniform closure results for algebraic classes under factoring., , and . STOC, page 1152-1165. ACM, (2018)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)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)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)Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good., , , and . Electron. Colloquium Comput. Complex., (2017)An efficient fragile watermarking scheme for tamper localization in satellite images., , and . Comput. Electr. Eng., 109 (Part B): 108783 (August 2023)Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits., and . FOCS, page 200-211. IEEE, (2022)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)Efficiently Factoring Polynomials Modulo p4., , and . ISSAC, page 139-146. ACM, (2019)