Login / Signup

Two-closures of supersolvable permutation groups in polynomial time.

Ilia PonomarenkoAndrey Vasil'ev
Published in: Comput. Complex. (2020)
Keyphrases
  • special case
  • artificial intelligence
  • clustering algorithm
  • databases
  • data mining
  • information retrieval
  • data structure
  • computational complexity
  • approximation algorithms
  • finite automata