19 citations · 56 across the 28 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2011
On Gröbner Basis Detection for Zero-dimensional Ideals
Prabhanjan Ananth, Ambedkar Dukkipati
The Gröbner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if "yes" find- a term order such that the set of polynomials i…
cs.CC2011★ 19 cited
New Hardness Results in Rainbow Connectivity
Prabhanjan Ananth, Meghana Nasre
A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists…
cs.CC2010
Border basis detection is NP-complete
Prabhanjan V. Ananth, Ambedkar Dukkipati
Border basis detection (BBD) is described as follows: given a set of generators of an ideal, decide whether that set of generators is a border basis of the ideal with respect to so…