Reachability is harder for directed than for undirected finite graphs
- Miklos Ajtai
- Ronald Fagin
- 1987
- FOCS 1987
Publications
Date
Featured collections
Popular topics
4 results at FOCS 1987
Results on learnability and the Vapnik-Chervonenkis dimension
- Nathan Linial
- Yishay Mansour
- et al.
- 1987
- FOCS 1987
Complexity of the pigeonhole principle
- Miklos Ajtai
- 1987
- FOCS 1987
Notes on searching in multidimensional monotone arrays
- Alok Aggarwal
- James Park
- 1987
- FOCS 1987