( en | de | ru )

 

Disambiguation of "Datta, Samir"

Author of the publication

copydeleteadd this publication to your clipboard
On TC0, AC0, and Arithmetic Circuits.

, , and . CCC, page 134-148. IEEE Computer Society, (1997)

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.

Alireza Samir

Asit Datta

Proyag Datta

Kais al- Samir

Samer al- Samir

 

Other publications of authors with the same name

3-connected Planar Graph Isomorphism is in Log-space., , and . FSTTCS, volume 2 of LIPIcs, page 155-162. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2008)Topology inside NC1, , and . Electron. Colloquium Comput. Complex., (2004)Depth-First Search in Directed Graphs, Revisited., , and . Electron. Colloquium Comput. Complex., (2020)On the complexity of algebraic numbers, and the bit-complexity of straight-line programs., , , and . Comput., 12 (2): 145-173 (2023)Planar Graph Isomorphism Is in Log-Space., , , , and . ACM Trans. Comput. Theory, 14 (2): 8:1-8:33 (2022)Dynamic Planar Embedding Is in DynFO., , and . MFCS, volume 272 of LIPIcs, page 39:1-39:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs., , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 13-24. Springer, (2014)Collapsing Exact Arithmetic Hierarchies., and . WALCOM, volume 8344 of Lecture Notes in Computer Science, page 273-285. Springer, (2014)Computing Bits of Algebraic Numbers., and . TAMC, volume 7287 of Lecture Notes in Computer Science, page 189-201. Springer, (2012)Space Complexity of Optimization Problems in Planar Graphs., and . TAMC, volume 8402 of Lecture Notes in Computer Science, page 300-311. Springer, (2014)