论文信息 - Information Flow and Width of Branching Programs (Extended Abstract) - 字舞流文

Information Flow and Width of Branching Programs (Extended Abstract)

[1] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[2] Vojtech Rödl,et al. Two lower bounds for branching programs , 1986, STOC '86.

[3] Richard J. Lipton,et al. Multi-party protocols , 1983, STOC.

[4] David A. Mix Barrington,et al. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.

[5] Stasys Jukna,et al. Lower Bounds on the Complexity of Local Circuits (Preliminary Report) , 1986, MFCS.

[6] Béla Ágai,et al. CONDENSED 1,3,5-TRIAZEPINES - V THE SYNTHESIS OF PYRAZOLO [1,5-a] [1,3,5]-BENZOTRIAZEPINES , 1983 .

[7] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.