Login / Signup

Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups.

François Le GallTomoyuki MorimaeHarumichi NishimuraYuki Takeuchi
Published in: MFCS (2018)
Keyphrases
  • special case
  • computational complexity
  • data sets
  • case study
  • user interface
  • theorem prover
  • real time
  • databases
  • neural network
  • data mining
  • multiscale
  • search algorithm
  • user friendly
  • theorem proving