75 citations to 10.1007/BF02122698 (Crossref Cited-By Service)
  1. K. L. Rychkov, “On the Perfectness of Minimal Regular Partitions of the Edge Set of the n-Dimensional Cube”, J. Appl. Ind. Math., 13, no. 4, 2019, 717  crossref
  2. Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson, “Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation”, SIAM J. Comput., 46, no. 1, 2017, 114  crossref
  3. Stasys Jukna, Advances in Network Complexity, 2013, 99  crossref
  4. Harry Vinall-Smeeth, Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024, 1  crossref
  5. Reijo Jaakkola, Antti Kuusisto, Miikka Vilander, “Relating Description Complexity to Entropy”, Journal of Computer and System Sciences, 2024, 103615  crossref
Previous
1
2
3
4
5
6
7
8