Thanks for the memories
- 期刊名称Journal of the American Pharmaceutical Association (1961)
- 作者Thibault, Eloise D.
- 卷第41卷
- 印刷ISSN0003-0465
- 文件大小1978.14KB
- 发表时间2001-07
- DOI10.1016/s0003-0465(15)33314-0
- 页码4-5
The weighted complete intersection theoremFilmus, Yuval · Journal of Combinatorial Theory, Series A · 2017
More complete intersection theoremsFilmus, Yuval · Discrete Mathematics · 2019
Lower bounds for context-free grammarsYuval Filmus · 2011
FKN theorem for the multislice, with applicationsFilmus, Yuval · Combinatorics, Probability and Computing · 2019
Inequalities on submodular functions via term rewritingFilmus, Yuval · Information Processing Letters · 2013
Triangle-intersecting families of graphsEllis, David; Filmus, Yuval; Friedgut, Ehud · Journal of the European Mathematical Society · 2012
Space Complexity in Polynomial CalculusFilmus, Yuval; Lauria, Massimo; Nordström, Jakob; Ron-Zewi, Noga; Thapen, Neil · SIAM Journal on Computing · 2015
Online submodular maximization: beating 1/2 made simpleBuchbinder, Niv; Feldman, Moran; Filmus, Yuval; Garg, Mohit · Mathematical Programming · 2020
P automata revisitedPăun, Gheorghe; Pérez-Jiménez, Mario J. · Theoretical Computer Science · 2012
Consistency of multidimensional combinatorial substitutionsJolivet, Timo; Kari, Jarkko · Theoretical Computer Science · 2012
Quantum counterfeit coin problemsIwama, Kazuo; Nishimura, Harumichi; Raymond, Rudy; Teruyama, Junichi · Theoretical Computer Science · 2012
Reversible iterative graph processesDourado, Mitre C.; Penso, Lucia Draque; Rautenbach, Dieter; Szwarcfiter, Jayme L. · Theoretical Computer Science · 2012
Lowness for bounded randomnessDowney, Rod; Ng, Keng Meng · Theoretical Computer Science · 2012
Lower bound for balanced setsNedev, Zhivko · Theoretical Computer Science · 2012
The lattice structure of -player gamesCincotti, Alessandro · Theoretical Computer Science · 2012
Chordal digraphsMeister, Daniel; Telle, Jan Arne · Theoretical Computer Science · 2012