activity
20062020
most citedThe quantum FFT can be classically simulated

40 citations · 48 across the 6 of their papers we have counts for

collaborators
Showing cs.LOShow all

1 paper · 1 filter

cs.LO2015

Efficient computation of generalized Ising polynomials on graphs with fixed clique-width

Tomer Kotek, Johann A. Makowsky

Graph polynomials which are definable in Monadic Second Order Logic (MSOL) on the vocabulary of graphs are Fixed-Parameter Tractable (FPT) with respect to clique-width. In contrast…