The going-up and going-down theorems in residuated lattices
- 期刊名称Soft Computing
- 作者Rasouli, Saeed
- 印刷ISSN1432-7643
- 电子ISSN1433-7479
- 文件大小610.09KB
- 发表时间2019-1-17
- DOI10.1007/s00500-019-03780-3
同期刊推荐
Diametric theorems in sequence spacesR. Ahlswede; N. Cai; Z. Zhang · Combinatorica · 1992
Small transversals in hypergraphsV. Chvátal; C. McDiarmid · Combinatorica · 1992
On integer points in polyhedraW. Cook; M. Hartmann; R. Kannan; C. McDiarmid · Combinatorica · 1992
Spanning trees of extended graphsA. K. Kelmans · Combinatorica · 1992
On rank vs. communication complexityNoam Nisan; Avi Wigderson · Combinatorica · 1995
Colouring a graph frugallyHugh Hind; Michael Molloy; Bruce Reed · Combinatorica · 1997
Expanding graphs and invariant meansYehuda Shalom · Combinatorica · 1997
Universally signable graphsMichele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vušković · Combinatorica · 1997