The following pages link to H. Venkateswaran (Q1156456):
Displayed 11 items.
- A parallel Wilf algorithm for complex zeros of a polynomial (Q1156457) (← links)
- Errata: A parallel Wilf algorithm for complex zeros of a polynomial (Q1156458) (← links)
- Properties that characterize LOGCFL (Q1176109) (← links)
- A lower bound for monotone arithmetic circuits computing \(0-1\) permanent (Q1276316) (← links)
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← links)
- Two dynamic programming algorithms for which interpreted pebbling helps (Q2277375) (← links)
- A circuit-based proof of Toda's theorem (Q2366565) (← links)
- (Q3817611) (← links)
- A New Pebble Game that Characterizes Parallel Complexity Classes (Q3835026) (← links)
- Circuit Definitions of Nondeterministic Complexity Classes (Q4016401) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465877) (← links)