No. Title Author Year
1 Characterization and Lower Bounds for Branching Program Size Using Projective Dimension Dinesh, Krishnamoorthy et al. 2016
2 Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space Dhayal, Anant et al. 2014
3 Pebbling, Entropy and Branching Program Size Lower Bounds Komarath, Balagopal et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 3

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI