Login / Signup

Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG].

Christoph BehleAndreas KrebsStephanie Reifferscheid
Published in: LATA (2009)
Keyphrases
  • np complete
  • special case
  • np hard
  • first order logic
  • databases
  • computational complexity
  • transitive closure
  • case study