The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
This paper investigates one possible model of reversible computations, an important paradigm in the context of quantum computing. Introduced by Bennett, a reversible pebble game is an abstraction of reversible computation that allows to examine the space and time complexity of various classes of problems. We present a technique for proving lower and upper bounds on time and space complexity for several types of graphs. Using this technique we show that the time needed to achieve optimal space for...
This paper investigates one possible model of reversible computations, an
important paradigm in the context of quantum computing. Introduced by
Bennett, a reversible pebble game is an
abstraction of reversible computation that allows to examine the space and
time complexity of various classes of problems. We present a technique
for proving lower and upper bounds on time and space complexity for several
types of graphs. Using this technique we show that the time needed to
achieve optimal space for...
Recently, a new measurement – the – was introduced for measuring the information content of online problems. The aim is to measure the bitwise information that online algorithms lack, causing them to perform worse than offline algorithms. Among a large number of problems, a well-known scheduling problem, , and the problem were analyzed within this model. We observe some connections between advice complexity and randomization. Our special focus goes to barely random algorithms, , randomized algorithms...
Recently, a new measurement – the –
was introduced for measuring the information content of online
problems. The aim is to measure
the bitwise information that online algorithms lack, causing them to perform
worse than offline algorithms. Among a large number of problems, a well-known
scheduling problem, ,
and the problem were analyzed within this model.
We observe some connections between advice complexity
and randomization. Our special focus goes to barely random algorithms,
, randomized...
Download Results (CSV)