We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Customizable meta-objects are a powerful abstraction for extending language features and implementation mechanisms, but interpretive execution suffers from severe performance penal...
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
The mpC language was developed to write efJicientand portable programsfor wide range of distributed memory machines. It supports both task and data parallelism, allows both static...
Dmitry Arapov, Alexey Kalinov, Alexey L. Lastovets...
Successor state axioms are an optimal solution to the famous Frame Problem in reasoning about actions--but only as far as its representational aspect is concerned. We show how by g...