• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

On the Bit Complexity of Sum-of-Squares Proofs.

Prasad RaghavendraBenjamin Weitz
Published in: ICALP (2017)
Keyphrases
  • computational complexity
  • theorem proving
  • computational cost
  • database
  • social networks
  • memory requirements
  • high computational complexity
  • formal proofs