5h
asked Number of non-isomorphic embeddings.
5h
comment Are all Hamiltonian planar graphs are 4 colorable? Does this imply all planar graphs are colorable?
what do you mean by no 3-cycles which are not faces? Aren't all 3-cycles in a planar graph faces?
7h
comment Number of perfect matchings of bipartite graphs
@how may numbers we miss? he gave a bound.
7h
comment Largest number of perfect matchings in bounded genus graphs
$g$ scales with $n$ it is unlikely you get a nice formula so easily
1d
reviewed Reject suggested edit on More generalized RSA construction
1d
comment Minimum weights needed to derandomize weight assignment by isolation lemma
@DavidEppstein someone copied and pasted your answer.
2d
revised More generalized RSA construction
added 4 characters in body; edited tags
2d
accepted On intersection of classes
2d
comment Is cyclic group specified as part of input in discrete logarithm problem?
@SashoNikolov that is correct. may be there is no nice way to frame the problem. What I am thinking is even if you know $p$ ahead of time it is hard for your to find discrete log with any reasonable technique. This is what I am trying to convey. But if there is a way break one there is a way to break another. But this intuition fails for p/poly type situation.
2d
revised Is cyclic group specified as part of input in discrete logarithm problem?
added 95 characters in body
2d
comment Is cyclic group specified as part of input in discrete logarithm problem?
@EmilJeřábek I dont know what you are talking as the space needed even if $p$ is known blows up if you want to make table (if that is your suggestion) and definition of $\mathsf{p/poly}$ is you have polynomial size advice bits
2d
comment On intersection of classes
I assumed they have non-trivial intersection apriori. Another reason I asked was many NP complete problems can be morphed to one another. I wanted to see if there is even an easy way to define intersection in that scenario. It is a badly framer post but not unsure how to make it better.
2d
asked On intersection of classes
2d
asked More generalized RSA construction
2d
revised Is cyclic group specified as part of input in discrete logarithm problem?
deleted 174 characters in body
2d
comment Is Dist − NP ⊆ Avg − P a reasonable stance?
@Raphael Do you know what "is there any reason" means?
Apr
28
comment Is Dist − NP ⊆ Avg − P a reasonable stance?
reasonable cause of downvote?
Apr
28
comment Approximate value of k
@AndréNicolas I like your approach. Anything sharp or sharper than you have and how you do it will be greatly helpful.
Apr
28
comment Approximate value of k
Yeah I know it is close to linear in $n$. I want very tight approximation.
Apr
28
asked Approximate value of k
1 2 3 4 5