scientific article; zbMATH DE number 1929968

zbMath1014.68108MaRDI QIDQ4708603

Catherine McCartin

Publication date: 18 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2420/24200556.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Related Items (4)

Parameterised counting in logspace ⋮ Efficient algorithms for counting parameterized list \(H\)-colorings ⋮ The parameterized complexity of probability amplification ⋮ The complexity of counting homomorphisms seen from the other side

This page was built for publication: