Sciweavers

FCT
1991
Springer
14 years 3 months ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini
COCO
2010
Springer
215views Algorithms» more  COCO 2010»
14 years 3 months ago
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata
—We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symm...
Eric Allender, Klaus-Jörn Lange