Author:
Sakai Takayuki,Seto Kazuhisa,Tamaki Suguru,Teruyama Junichi
Funder
JSPS
Kyoto University
JST ERATO Kawarabayashi Large Graph Project
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference68 articles.
1. More applications of the polynomial method to algorithm design;Abboud,2015
2. A nonuniform circuit class with multilayer of threshold gates having super quasi polynomial size lower bounds against NEXP;Amano,2015
3. A satisfiability algorithm for some class of dense depth two threshold circuits;Amano;IEICE Trans.,2015
4. The expressive power of voting polynomials;Aspnes;Combinatorica,1994
5. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs;Babai;J. Comput. Syst. Sci.,1992
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fooling Constant-Depth Threshold Circuits (Extended Abstract);2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02