Complexity theory is a branch of computer science that studies the resources required to solve computational problems, particularly focusing on the classification of problems based on their inherent ...

Mark Jerrum, Alistair Sinclair (UC Berkeley) and Eric Vigoda (Georgia Tech) received the Association for Computing Machinery (ACM) Test of Time Award at a virtual ceremony on Wednesday 23 June at the ...

The second path matrix S(G) collects all the second paths in the graph G. Its characteristic polynomial shows some regularity in several particular graphs, such as paths, cycles, stars and complete ...

Abstract. We present a nonparametric approach based on local polynomial regression for ensemble forecast of time series. The state space is first reconstructed by embedding the univariate time series ...

The quantum Bruhat graph, which is an extension of the graph formed by covering relations in the Bruhat order, is naturally related to the quantum cohomology ring of G/B. We enhance a result of Fulton ...

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