H. Venkateswaran

Available identifiers

zbMath Open venkateswaran.hMaRDI QIDQ1156456

List of research outcomes

Publication	Date of Publication	Type
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science	2005-08-12	Paper
Non-cancellative Boolean circuits: A generalization of monotone boolean circuits	2000-06-04	Paper
A lower bound for monotone arithmetic circuits computing \(0-1\) permanent	1999-02-02	Paper
A circuit-based proof of Toda's theorem	1993-08-30	Paper
Circuit Definitions of Nondeterministic Complexity Classes	1992-12-14	Paper
Properties that characterize LOGCFL	1992-06-25	Paper
Two dynamic programming algorithms for which interpreted pebbling helps	1991-01-01	Paper
A New Pebble Game that Characterizes Parallel Complexity Classes	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3817611	1988-01-01	Paper
A parallel Wilf algorithm for complex zeros of a polynomial	1981-01-01	Paper
Errata: A parallel Wilf algorithm for complex zeros of a polynomial	1981-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: H. Venkateswaran