Theoretical Computer Science
SagarM
  • Member for 2 years, 9 months
  • Last seen more than a week ago
  • Trento, Italy
Profile Activity
Stats
654
reputation
3k
reached
1
answer
16
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
8
bronze badges
Top tags
View all tags
0
Score
9
Posts
53
Posts %
0
Score
4
Posts
24
Posts %
0
Score
4
Posts
24
Posts %
0
Score
3
Posts
18
Posts %
0
Score
2
Posts
12
Posts %
0
Score
2
Posts
12
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
9
Existing implementation of Scott's reduction?
Jul 30 '20
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 '21
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
3
Normal forms for counting quantifiers?
Aug 1 '20
2
Is Scott's reduction sound for $\mathrm{FO}^2$ with equality?
Aug 8 '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
How does complexity of a counting problem influence wether it admits a closed form formula or not?
Oct 22 '20
Top network posts
View all network posts
6
What does $\exists^{=1}$ stands for?
6
Visually stunning math concepts which are easy to explain
6
Showing Logical Equivalence
5
How can I formally prove that undirected graphs cannot be axiomatised in First Order Logic with only unary predicates?

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.