You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A series of programs that enable one's investigations in the algebraic complexity theory such as matrix multiplication algorithms, primality tests, algebraic complexity, sorting algorithms etc. Each algorithm is accompanied by a comparative time complexity analysis and a class of test cases and test suites.
Design and implementation of a fast Earley parser with some test cases in Wolfram language ....... also a ready-made lexer with parsing with the grammar for all the regular languages :) :) ....
Some work on the paper, "Automated Lie-algebraic input space partitioning using first-order two-dimensional cellular automata" by me (Shrohan Mohapatra. (2020, June 5). Automated Lie-algebraic input space partitioning using first-order two-dimensional cellular automata. Zenodo. http://doi.org/10.5281/zenodo.3880404), here in the specific example…
A Mathematica package by the name 'Polynomial adaptive cellular automata' to get the quasi-normal modes for the particles oscillating in the background of a black hole.