scientific article; zbMATH DE number 2080928
From MaRDI portal
Publication:4473997
zbMath1052.68041MaRDI QIDQ4473997
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2234/22340292.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Quantum computation (81P68)
Related Items (5)
Reversible Pebble Game on Trees ⋮ Pebbling meets coloring: reversible pebble game on trees ⋮ The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs ⋮ The cost of adaptivity in security games on graphs ⋮ Boolean satisfiability in quantum compilation
This page was built for publication:
