We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...
In this paper, we present a general revision model on epistemic states based on plausibility measures proposed by Friedman and Halpern. We propose our revision strategy and give so...
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q...
Given a list of filtering rules with individual hitting probabilities, it is known that the average processing time of a linear-search based firewall can be minimized by searchi...