Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
The problem of complementing Büchi automata arises when developing decision procedures for temporal logics of programs. Unfortunately, previously known constructions for complementing Büchi automata involve a doubly exponential blow-up in the size of the automaton. We present a construction that involves only an exponential blow-up. We use this construction to prove a polynomial space upper bound for the propositional temporal logic of regular events and to prove a complexity hierarchy result for quantified propositional temporal logic. © 1987.
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Preeti Malakar, Thomas George, et al.
SC 2012
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006