Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms, any ...

All UAB students, faculty and guests are invited. In this talk, for an ergodic probability preserving system (X,B,m,T), we will discuss the existence of a Z^d valued function , whose corresponding ...