On P versus NP CO-NP for decision trees and read-once branching programs

Lower bounds for linearly transformed OBDDs and FBDDs

Journal of Computer and System Sciences

Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science

A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs

Information Processing Letters

Interpolation of the discrete logarithm in Fq by Boolean functions and by polynomials in several variables modulo a divisor of q - 1

Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)

Complexity of some arithmetic problems for binary polynomials

Computational Complexity

On the P versus NP intersected with co-NP question in communication complexity

Information Processing Letters

A hierarchy result for read-once branching programs with restricted parity nondeterminism

Theoretical Computer Science - Mathematical foundations of computer science 2000

Minimization of decision trees is hard to approximate

Journal of Computer and System Sciences

On the P versus NP intersected with co-NP question in communication complexity

Information Processing Letters

Yet harder knapsack problems

Theoretical Computer Science