No. Title Author Year
1 Derandomization via Symmetric Polytopes: Poly-Time Factorization of Certain Sparse Polynomials Bisht, Pranav et al. 2022
2 Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits Bhargav, C. S. et al. 2022
3 A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization Dutta, Pranjal et al. 2021
4 Deterministic Identity Testing Paradigms for Bounded Top-Fanin Depth-4 Circuits Dutta, Pranjal et al. 2021
5 Front Matter, Table of Contents, Preface, Conference Organization Saxena, Nitin et al. 2020
6 LIPIcs, Volume 182, FSTTCS 2020, Complete Volume Saxena, Nitin et al. 2020
7 Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications Dwivedi, Ashish et al. 2019
8 Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity Guo, Zeyu et al. 2018
9 Towards Blackbox Identity Testing of Log-Variate Circuits Forbes, Michael A. et al. 2018
10 Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits Pandey, Anurag et al. 2016
11 Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs Gurjar, Rohit et al. 2016
12 Integer Factoring Using Small Algebraic Dependencies Agrawal, Manindra et al. 2016
13 Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs Gurjar, Rohit et al. 2015
14 The Power of Depth 2 Circuits over Algebras Saha, Chandan et al. 2009
15 Diagonal Circuit Identity Testing and Lower Bounds Saxena, Nitin 2008
Current Page :
Number of result pages: 1
Number of documents: 15

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI