Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T15:38:14.171Z Has data issue: false hasContentIssue false

Time and space complexity of reversible pebbling

Published online by Cambridge University Press:  15 June 2004

Richard Královič*
Affiliation:
Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Mlynská Dolina, 842 48 Bratislava, Slovakia; rkralovi@dcs.fmph.uniba.sk.
Get access

Abstract

This paper investigates one possible model of reversible computations, animportant paradigm in the context of quantum computing. Introduced byBennett, a reversible pebble game is anabstraction of reversible computation that allows to examine the space andtime complexity of various classes of problems. We present a techniquefor proving lower and upper bounds on time and space complexity for severaltypes of graphs. Using this technique we show that the time needed toachieve optimal space for chain topology is Ω(nlgn) for infinitelymany n and we discusstime-space trade-offs for chain. Further we show a tight optimalspace bound for the binary tree of height h of the form h + Θ(lg*h)and discuss space complexity for the butterfly. These results give anevidence that reversible computations need more resources than standardcomputations. We also show an upper bound on time and space complexity ofthe reversible pebble game based on the time and space complexity of thestandard pebble game, regardless of the topology of the graph.

Information

Type
Research Article
Copyright
© EDP Sciences, 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable