Ashish Dwivedi

Orcid: 0000-0003-2943-0066

According to our database1, Ashish Dwivedi authored at least 16 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Solving polynomial systems over non-fields and applications to modular polynomial factoring.
J. Symb. Comput., 2024

Digital twins' readiness and its impacts on supply chain transparency and sustainable performance.
Ind. Manag. Data Syst., 2024

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields.
Electron. Colloquium Comput. Complex., 2024

Optimizing cloud resource utilization in the digital economy: An integrated Pythagorean fuzzy-based decision-making approach.
Adv. Eng. Informatics, 2024

2023
Modeling the blockchain readiness challenges for product recovery system.
Ann. Oper. Res., August, 2023

A comparative study of GA and PSO approach for cost optimisation in product recovery systems.
Int. J. Prod. Res., February, 2023

Studying the interactions among Industry 5.0 and circular supply chain: Towards attaining sustainable development.
Comput. Ind. Eng., February, 2023

Antecedents of digital supply chains for a circular economy: a sustainability perspective.
Ind. Manag. Data Syst., 2023

Big data-Industry 4.0 readiness factors for sustainable supply chain management: Towards circularity.
Comput. Ind. Eng., 2023

Delving Into the Interdependencies in the Network of Economic Sustainability Innovations.
IEEE Access, 2023

2021
Efficiently factoring polynomials modulo <i>p</i><sup>4</sup>.
J. Symb. Comput., 2021

2020
Computing Igusa's local zeta function of univariates in deterministic polynomial-time.
Electron. Colloquium Comput. Complex., 2020

2019
Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications.
Electron. Colloquium Comput. Complex., 2019

Efficiently factoring polynomials modulo $p^4$.
Electron. Colloquium Comput. Complex., 2019

Efficiently factoring polynomials modulo p<sup>4</sup>.
CoRR, 2019

Efficiently Factoring Polynomials Modulo p4.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019


  Loading...