output
20092024
most citedA Simplification of a Real-Time Verification Problem

11 citations

researchers with a paper here
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2009★ 2 cited

A Randomized Algorithm for 3-SAT

Subhas Kumar Ghosh, Janardan Misra

In this work we propose and analyze a simple randomized algorithm to find a satisfiable assignment for a Boolean formula in conjunctive normal form (CNF) having at most 3 literals…

cs.DS2009★ 5 cited

Some Results On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs

Subhas Kumar Ghosh, Koushik Sinha

A greedy embedding of a graph into a metric space is a function such that in the embedding for every pair of non-adjacent vertices …