Functions that have read-once branching programs of quadratic size are not necessarily testable
Information Processing Letters
Relating branching program size and formula size over the full binary basis
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
The multiparty communication complexity of exact-T: improved bounds and new problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On some bounds on the size of branching programs (a survey)
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata
Theoretical Computer Science
| Hi-index | 5.23 |