Author:
Jakoby Andreas,Reischuk Rüdiger,Schindelhauer Christian
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference20 articles.
1. On the theory of average case complexity;Ben-David;J. Comput. System Sci.,1992
2. An efficient implementation of Boolean functions and finite state machines as self-timed circuits;David;ACM Comput. Architecture News,1989
3. The depth of Boolean functions;Gaskov;Prob. Kybernet.,1978
4. Complete problems withL;Grape,1990
5. Average case completeness;Gurevich;J. Computer and System Sciences,1991
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Average case complexity of unbounded fanin circuits;Proceedings 15th Annual IEEE Conference on Computational Complexity