C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory.
Juraj Hromkovic
Georg Schnitger
Published in:
DCFS (2005)
Keyphrases
</>
computational cost
computational complexity
lower bound
objective function
formal language theory
databases
metadata
prior knowledge
data model
worst case
matching algorithm
structural information