Computer Science
Blanco's user avatar
Blanco's user avatar
Blanco's user avatar
Blanco
  • Member for 6 years, 2 months
  • Last seen more than a month ago
  • China
Profile Activity
Stats
623
reputation
10k
reached
2
answers
26
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
3
silver badges
17
bronze badges
Top tags
View all tags
1
Score
4
Posts
14
Posts %
1
Score
3
Posts
11
Posts %
0
Score
5
Posts
18
Posts %
0
Score
4
Posts
14
Posts %
0
Score
4
Posts
14
Posts %
0
Score
3
Posts
11
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
5
Is there a formal definition of sub-instances or sub-problems?
Oct 19, 2020
question
3
Are finite state transducers and Mealy machines the same machines?
Oct 11, 2017
question
3
Can a computational complexity class be redefined by using any complete (decision) problem?
Nov 18, 2020
question
3
Is there any polytime reduction from feedback vertex set to vertex cover?
Dec 31, 2020
question
3
Is there a way to study precisely the complexity with respect to the size of vertex set for some graph problem?
May 25, 2021
question
2
What is the explicit definition about the computablity of non-deterministic Turing machine?
Oct 5, 2017
question
2
Why do the definitions of non-deterministic Turing machines look strange?
Oct 7, 2017
question
2
What is the relationship between oracle Turing machine $M^O$ and Turing machine $M$ (given $O$)?
Oct 24, 2017
question
2
Is there some mathematical properties of the distribution which is the output of a probabilistic polynomial-time Turing machine?
Dec 7, 2017
question
2
A question about the definition of PRFs
Feb 27, 2018
Top network posts
View all network posts
137
Consequences resulting from Yitang Zhang's latest claimed results on Landau-Siegel zeros
95
Does Schnorr's 2021 factoring method show that the RSA cryptosystem is not secure?
11
What is the relation between the existence of a cryptographic hash function and the existence of a PRG?
11
The theoretical complexity of Go - The state of the art
8
Are there infinitely many $n$ s.t. $\prod_i^n a_i = \sum^n_i a_i$ only if the number of $1$ in vector $(a_i)_i \in \mathbb{N}^n$ is $n-2$?

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.