"On Complexity of Regular (1, +k)-Branching Programs."

Farid M. Ablayev (2000)

Details and statistics

DOI:

access: unavailable

type: Conference or Workshop Paper

metadata version: 2019-03-06

a service of  Schloss Dagstuhl - Leibniz Center for Informatics