Theoretical Computer Science
Profile Activity
Meta user
Network profile
614
reputation
2
8

SagarM

Apparently, this user prefers to keep an air of mystery about them.

1
answer
17
questions
~2k
people reached
  • Trento, Italy
  • Member for 2 years, 1 month
  • 91 profile views
  • Last seen May 4 at 17:43

Communities (22)

Top network posts

Top tags (17)

Score 0
Posts 9
Posts % 50
Score 0
Posts 4
Score 0
Posts 4
Score 0
Posts 3
Score 0
Posts 3
Score 0
Posts 2
View all tags →

Top posts (18)

All Questions Answers
Votes Newest
8 Is there any online lecture series that covers “Computational Complexity: A Modern Approach”? Nov 6 '20
8 Are there analogous works to PPSZ algorithm for #P? Feb 19
6 Are all computational models of quantum computing equivalent? Nov 24 '20
6 Can modern SAT-Solvers utilise the symmetry of First Order Logic? Jul 6 '20
6 Existing implementation of Scott's reduction? Jul 30 '20
3 Normal forms for counting quantifiers? Aug 1 '20
2 Scott's normal form for $\exists y \forall x R(x,y) $ Dec 14 '20
2 What is the computational complexity of Acyclic Joins? Mar 3 '20
1 Is Scott's reduction sound for $\mathrm{FO}^2$ with equality? Aug 8 '20
1 How does complexity of a counting problem influence wether it admits a closed form formula or not? Oct 22 '20
View all questions and answers →

Badges (10)

Gold

—

Silver

2

Rarest

Bronze

8

Rarest

View all badges →

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.