Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
Algorithmic Foundations of Inexact Computing
John Augustine, Dror Fried, Krishna V. Palem +2
Inexact computing also referred to as approximate computing is a style of designing algorithms and computing systems wherein the accuracy of correctness of algorithms executing on…
cs.DS2020
A polynomial time parallel algorithm for graph isomorphism using a quasipolynomial number of processors
Duc Hung Pham, Krishna V. Palem, M. V. Panduranga Rao
The Graph Isomorphism (GI) problem is a theoretically interesting problem because it has not been proven to be in P nor to be NP-complete. Babai made a breakthrough in 2015 when an…