In morphologically rich languages such as Arabic, the abundance of word forms resulting from increased morpheme combinations is significantly greater than for languages with fewer...
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable co...
In our previous work, a highly scalable and faulttolerant network architecture, the Progressive Multi-hop Rotational Clustered (PMRC) structure, is proposed for constructing large...
Qiaoqin Li, Mei Yang, Hongyan Wang, Yingtao Jiang,...
In this paper we consider the problem of constructing a small arithmetic circuit for a polynomial for which we have oracle access. Our focus is on n-variate polynomials, over a fi...