Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language | 0 | 0.34 | 2020 |
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. | 0 | 0.34 | 2019 |
On Block Sensitivity and Fractional Block Sensitivity. | 0 | 0.34 | 2018 |
Exact Affine Counter Automata | 0 | 0.34 | 2017 |
All Classical Adversary Methods are Equivalent for Total Functions. | 0 | 0.34 | 2017 |
Sensitivity versus Certificate Complexity of Boolean Functions. | 6 | 0.47 | 2015 |
An inverse distance-based potential field function for overlapping point set visualization | 3 | 0.38 | 2014 |
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity. | 4 | 0.43 | 2014 |
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity. | 0 | 0.34 | 2014 |
A Potential Field Function for Overlapping Point Set and Graph Cluster Visualization. | 0 | 0.34 | 2014 |