The one way function based on Collatz problem is proposed. While Colatz (3x + 1) problem is well known and undecided, the proposal is actually based on the problem’s underlying conditional branching structure. The analysis shows why the 3x + 1 problem is so difficult and how the algorithm conditional branching structure can be used to construct an one way function.

The maximum independent set problem is one of the most important problems in worstcase analysis for exact algorithms. Improvement on this problem in low-degree graphs can be used to get improvement on the problem in general graphs. In this paper, we show that the maximum independent set problem in an n-vertex graph with degree bounded by 4 can be solved in O∗(1.1376n) time and polynomial space,...

network environments always can be invaded by intruder agents. in networks where nodes are performing some computations, intruder agents might contaminate some nodes. therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. in this paper, we present a distributed asynchronous local algorithm for decontaminating a network. in mos...

the multiple traveling salesman problem (mtsp) is a generalization of the famous traveling salesman problem (tsp), where more than one salesman is used in the solution. although the mtsp is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. this paper presents an efficient and evolutionary optimization algorith...

Internal iliac artery (IIA) shows frequent variations in its branching pattern. We saw variations in the branching pattern of right IIA in a male cadaver. The IIA divided into anterior and posterior divisions. The branches of the anterior division included umbilical artery, inferior vesical artery, obturator artery. The other branches arose from posterior trunk such as iliolumbar, lateral s...

Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...

In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...

We present an explicit pseudorandom generator with seed length Õ((log n)w+1) for read-once, oblivious, width w branching programs that can read their input bits in any order. This improves upon the work of Impaggliazzo, Meka and Zuckerman (FOCS’12) where they required seed length n1/2+o(1). A central ingredient in our work is the following bound that we prove on the Fourier spectrum of branchin...

The purpose of this paper is to survey the possible topologies of branching space-times, and, in particular, to refute the popular notion in the literature that a branching space-time requires a non-Hausdorff topology. 1 Branching MWI space-times Two basic types of branching universe have been suggested in modern mathematical physics: universes which branch in a style befitting the ‘many-worlds...