Encoding complexities in decision problems of finitely presented combinatorial systems.

Ítems similars

• Encoding complexities in decision problems of finitely presented combinatorial systems.
  per: Madlener, Klaus
  Publicat: (1982)
• Finite complete Rewriting Systems and the complexity of the word problem
  per: Otto, Friedrich
  Publicat: (1984)
• Finite complete Rewriting Systems and the complexity of the word problem.
  per: Bauer, G.
  Publicat: (1984)
• Combinatorial Connectivities in social systems. An application of simplicial complex structures to the study of large organizations.
  per: Atkin, Ronald H.
  Publicat: (1977)
• Combinatorial Connectivities in social systems. An application of simplicial complex structures to the study of large organizations.
  per: Atkin, Ronald H.
  Publicat: (1977)