Yury Savateev

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009

2 EE Yury Savateev: Product-Free Lambek Calculus Is NP-Complete. LFCS 2009: 380-394

2008

1 EE Yury Savateev: Lambek Grammars with One Division Are Decidable in Polynomial Time. CSR 2008: 273-282

2009
2	EE	Yury Savateev: Product-Free Lambek Calculus Is NP-Complete. LFCS 2009: 380-394
2008
1	EE	Yury Savateev: Lambek Grammars with One Division Are Decidable in Polynomial Time. CSR 2008: 273-282