Currently, the research of emergency supplies distribution and decision models mostly focus on deterministic models and exact algorithm. A few of studies have been done on the multi-level distribution network and matheuristic algorithm. In this paper, random processes theory is adopted to establish emergency supplies distribution and decision model for multi-level network. By analyzing the char...

We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.

J. Kraj cek and P. Pudll ak proved that an almost optimal deterministic algorithm for TAUT exists if and only if there exists a p-optimal proof system for TAUT. In this paper we prove that an almost optimal deterministic algorithm for SAT exists if and only if there exists a p-optimal proof system for SAT. Combining Kraj cek and Pudll ak's result with our result we show that an optimal determin...

In this paper we consider the following problem: Given a set A ° of n lines in the plane, partition the plane into O(r 2) triangles so that no triangle meets more than O(n/r) lines of .~. We present a deterministic algorithm for this problem with O(nr log n log ° r) running time, where co is a constant < 3.33.

In the rendezvous problem, the goal for two mobile agents is to meet whenever this is possible. In the rendezvous with detection problem, an additional goal for the agents is to detect the impossibility of a rendezvous (e.g., due to symmetrical initial positions of the agents) and stop. We consider the rendezvous problem with and without detection for identical anonymous mobile agents (i.e., ru...

We consider the rendezvous problem for identical mobile agents (i.e., running the same deterministic algorithm) with tokens in a synchronous torus with a sense of direction and show that there is a striking computational difference between one and more tokens. More specifically, we show that 1) two agents with a constant number of unmovable tokens or with one movable token each cannot rendezvou...

We present a deterministic algorithm that computes the zeta function of a nonsupersingular elliptic curve E over a finite field with p elements in time quasi-quadratic in n. An older algorithm having the same time complexity uses the canonical lift of E, whereas our algorithm uses rigid cohomology combined with a deformation approach. An implementation in small odd characteristic turns out to g...