The following pages link to (Q3887347):
Displaying 4 items.
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity (Q1351496) (← links)
- On correctness conditions for algebra of recognition algorithms with \({\mu}\)-operators over pattern problems with binary data (Q1709845) (← links)
- On the essential test sets of discrete matrices (Q1894367) (← links)
- Combinatorial results on the complexity of teaching and learning (Q5096898) (← links)
