Entropy of contact circuits and lower bounds on their complexity-Reference-Cited by-同舟云学术

Entropy of contact circuits and lower bounds on their complexity

Author:

Jukna Stasys P.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference29 articles.

1. Two lower bounds for branching programs;Ajtai;Proc. 18th ACM STOC,1986

2. Random walks, universal sequences and the complexity of maze problems;Aleliunas;Proc. 20th IEEE Symp. on FOCS,1979

4. On a method of obtaining lower bounds for the complexity of individual monotone functions;Andreev;Dokl. Akad. Nauk SSSR,1985

5. Bounded-width polynomial size branching programs recognize exactly those languages in NC1;Barrington;Proc. 18th ACM STOC,1986

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Two Source Extractors for Asymptotically Optimal Entropy, and (Many) More;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Randomized OBDD-based graph algorithms;Theoretical Computer Science;2018-12

5. Randomized OBDD-Based Graph Algorithms;Structural Information and Communication Complexity;2015