Login / Signup

Two-closure of odd permutation group in polynomial time.

Sergei EvdokimovIlia N. Ponomarenko
Published in: Discret. Math. (2001)
Keyphrases
  • special case
  • real time
  • database systems
  • data structure
  • computational complexity
  • group members
  • information systems
  • expressive power
  • approximation algorithms
  • np hardness