Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Dukkipati, Ambedkar"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A faster algorithm for testing polynomial representability of functions over finite integer rings
Ashwin Guha
,
Ambedkar Dukkipati
Theoretical Computer Science
579
, 2015, pp. 88-99
Reduced Gröbner bases and Macaulay-Buchberger Basis Theorem over Noetherian rings
Maria Francis
,
Ambedkar Dukkipati
Journal Symbolic Computation
65
, 2014, pp. 1-14
An algebraic characterization of rainbow connectivity
Prabhanjan Ananth
,
Ambedkar Dukkipati
Lecture Notes in Computer Science
7442
, 2012, pp. 12-21
Complexity of Gröbner basis detection and border basis detection
Prabhanjan V. Ananth
,
Ambedkar Dukkipati
Theoretical Computer Science
459
, 2012, pp. 1-15
Border basis detection is NP-complete
Prabhanjan Vijendra Ananth
,
Ambedkar Dukkipati
Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, ISSAC'2011 (San Jose, CA, USA, June 8-11, 2011)
, 2011, pp. 11-18
An algebraic implicitization and specialization of minimum KL-divergence models
Ambedkar Dukkipati
,
Joel George Manathara
Lecture Notes in Computer Science
6244
, 2010, pp. 85-96