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
[3]
Hilfe
Suche: Author="Sengupta, Rimli"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Non-cancellative Boolean circuits: A generalization of monotone Boolean circuits
Rimli Sengupta
,
H. Venkateswaran
Theoretical Computer Science
237
(1-2), 2000, pp. 197-212
A lower bound for monotone arithmetic circuits computing 0-1 permanent
Rimli Sengupta
,
H. Venkateswaran
Theoretical Computer Science
209
(1-2), 1998, pp. 389-398
Cancellation is exponentially powerful for computing the determinant
Rimli Sengupta
Information Processing Letters
62
(4), 1997, pp. 177-181
Non-cancellative Boolean circuits: A generalization of monotone Boolean circuits
Rimli Sengupta
,
H. Venkateswaran
Lecture Notes in Computer Science
1180
, 1996, pp. 298-309