12 citations · 34 across the 17 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LO2019
Pebble-Intervals Automata and FO2 with Two Orders (Extended Version)
Nadia Labai, Tomer Kotek, Magdalena Ortiz +1
We introduce a novel automata model, called pebble-intervals automata (PIA), and study its power and closure properties. PIAs are tailored for a decidable fragment of FO that is im…
cs.CC2019
The exact complexity of the Tutte polynomial
Tomer Kotek, Johann A. Makowsky
This is a survey on the exact complexity of computing the Tutte polynomial. It is the longer 2017 version of Chapter 25 of the CRC Handbook on the Tutte polynomial and related topi…