Login / Signup

Complexity of deciding bisimilarity between normed BPA and normed BPP.

Petr JancarMartin KotZdenek Sawa
Published in: Inf. Comput. (2010)
Keyphrases
  • graph matching
  • vector space
  • computational complexity
  • worst case
  • data sets
  • data mining
  • information retrieval
  • bit rate
  • space complexity
  • information systems
  • upper bound
  • memory requirements