We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Currently, in the development of business applications, difficulties occasionally arise between the customer side and the supplier side, causing delays and higher development cost...
The design and implementation of advanced personalized database applications requires a preference-driven approach. Representing preferences as strict partial orders is a good cho...
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...