Graph theory has long provided a robust mathematical framework for investigating networks, relations and connectivity in both abstract and applied settings. Recent advances have markedly refined our ...

Researchers have used metamathematical techniques to show that certain theorems that look superficially distinct are in fact ...

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 ...

The axiomatic treatment of the computational complexity of partial recursive functions initiated by Blum is extended to relatively computable functions (as computed, for example, by Turing machines ...

Surprising connections between computer science and biology, two disciplines that study how information proliferates in time and space, have been revealed by a recent study. The authors of a new ...

In the last few years, a few dedicated mathematicians have begun to study the computational complexity of video games. Their goal is to determine the inherent difficulty of the games and how they ...

Prof. Wang's current research interests include text mining algorithms and systems, data modeling and its applications, and combinatorial optimizations. His previous interests included large-scale ...

To help curb the spread of covid-19 by exercising "social distancing", we will be cancelling our regular theory seminars immediately until further notice. A half-space (over the Boolean hypercube) is ...

This is a preview. Log in through your library . Abstract In the game theory approach to the problem of allocating cost, the users of a facility are viewed as players in a cooperative n-person game.