The exact complexity of the Tutte polynomial

10/20/2019
by   Tomer Kotek, et al.
0

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 topics, edited by J. Ellis-Monaghan and I. Moffatt, which is due to appear in the first quarter of 2020. In the version to be published in the Handbook the Sections 5 and 6 are shortened and made into a single section.

READ FULL TEXT
research
01/03/2022

The exact complexity of a Robinson tiling

We find the exact formula for the number of distinct n × n square patter...
research
03/07/2019

Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem

We study the problem of finding an exact solution to the consensus halvi...
research
11/25/2020

On a fast and nearly division-free algorithm for the characteristic polynomial

We review the Preparata-Sarwate algorithm, a simple O(n^3.5) method for ...
research
06/21/2021

A Note on the Polynomial Ergodicity of the One-Dimensional Zig-Zag process

We prove polynomial ergodicity for the one-dimensional Zig-Zag process o...
research
04/26/2019

Improving the complexity of Parys' recursive algorithm

Parys has recently proposed a quasi-polynomial version of Zielonka's rec...
research
01/17/2023

Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality

There is no single canonical polynomial-time version of the Axiom of Cho...

Please sign up or login with your details

Forgot password? Click here to reset