Skip to content
#

theoretical-computer-science

Here are 4 public repositories matching this topic...

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 :) :) ....

  • Updated Mar 17, 2021
  • Mathematica

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…

  • Updated Mar 17, 2021
  • Mathematica

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.

  • Updated Feb 26, 2023
  • Mathematica

Improve this page

Add a description, image, and links to the theoretical-computer-science topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the theoretical-computer-science topic, visit your repo's landing page and select "manage topics."

Learn more