We prove that deciding whether the Runner can win this turn (mate-in-1) in the Netrunner card game generalized to allow decks to contain an arbitrary number of copies of a card is weakly NP-hard. We also prove that deciding whether the Corp can win within two turns (mate-in-2) in this generalized Netrunner is weakly NP-hard.

The purpose of this paper is to introduce and study the concepts of intuitionistic fuzzy perfectly regular weakly generalized continuous mappings and intuitionistic fuzzy perfectly regular weakly generalized open mappings in intuitionistic fuzzy topological space. Some of their properties are explored.

In present times, there has been a substantial endeavor to generalize the classical notion of iterated function system (IFS). We introduce new type non-linear contraction namely cyclic Meir-Keeler contraction, which is generalization famous Banach contraction. show existence and uniqueness fixed point for Using this result, we propose IFS in literature construction fractals. Furthermore, extend...

In this paper, we give a new fixed point theorem forWeakly quasi-contraction maps in metric spaces. Our results extend and improve some fixed point and theorems in literature.    

In this paper, introducing a contraction principle on generalized metric spaces, a generalization of Banach’s fixed point theorem is obtained under the completeness condition of the space. Moreover, it is established that using such contraction principle completeness of the generalized metric space can be characterized.