Abstract: We prove a characterization of all polynomial-time computable queries on the class of interval graphs by sentences of fixed-point logic with counting. More precisely, it is shown that on the ...

This code contains three implementations of the polynomials in OCaml. It is intended as a pedagical exercise to demonstrate OCaml. The three implementations are : array_polynomial.ml: an ...

1 Department of Applied Mathematics of Iran University of Science and Technology (IUST), Narmak, Iran. 2 School of Information Science and Technology, Yunnan Normal University, Kunming, China. Let G ...

Abstract: Counting the number of independent sets of a graph G (denoted as NI(G)) is a classical #P-complete problem for graphs of degree greater or equal than 3. However, there are classes of graphs ...

I JUST ran into this issue #22104 and it took me way too long to find that github-issue to finally see an example of how to use the Polynomial correctly. Polynomial.fit uses scaled and shifted ...

ABSTRACT: Pattern recognition is a task of searching particular patterns or features in the given input. The data mining, computer networks, genetic engineering, chemical structure analysis, web ...