scientific article; zbMATH DE number 2080928

zbMATH Open1052.68041MaRDI QIDQ4473997FDOQ4473997

Authors: Richard Královič 

Publication date: 4 August 2004

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

Title of this publication is not available (Why is that?)

Recommendations

• Time and space complexity of reversible pebbling
• Reversibility and adiabatic computation: trading time and space for energy
• A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
• Reversible pebble game on trees
• scientific article; zbMATH DE number 1754652

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Quantum computation (81P68) Games involving graphs (91A43)

Cited In (9)

• Boolean satisfiability in quantum compilation
• Optimizing quantum space using spooky pebble games
• The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs
• Reversible pebble game on trees
• A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
• Pebbling meets coloring: reversible pebble game on trees
• The cost of adaptivity in security games on graphs
• Quantum circuits for high-degree and half-multiplication for post-quantum analysis
• Time and space complexity of reversible pebbling

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473997)