On the complexity of a set-union problem
暂无分享,去创建一个
[1] AroraSanjeev,et al. Probabilistic checking of proofs , 1998 .
[2] Rajeev Motwani,et al. On certificates and lookahead in dynamic graph problems , 1996, SODA 1996.
[3] Georg Schnitger. A Family of Graphs with Expensive Depth Reduction , 1982, Theor. Comput. Sci..
[4] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[5] Andrew W. Appel. Modern Compiler Implementation in ML: Basic Techniques , 1997 .
[6] Leslie G. Valiant,et al. Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.
[7] Jan van Leeuwen,et al. Worst-case Analysis of Set Union Algorithms , 1984, JACM.
[8] Endre Szemerédi,et al. On determinism versus non-determinism and related problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[9] Monika Henzinger,et al. Randomized dynamic graph algorithms with polylogarithmic time per operation , 1995, STOC '95.
[10] Satyanarayana V. Lokam. Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.