1,534 reputation
617
bio website
location
age 35
visits member for 4 years
seen Jul 3 at 21:51

Apr
7
revised How to simpify the way of calculating $(a^b \bmod c) \bmod d$?
wording; tex
Apr
7
revised How to simpify the way of calculating $(a^b \bmod c) \bmod d$?
wording; tex
Apr
2
revised graph-theory wiki description
linked to tag:graph to explain that it is different from this tag
Jan
26
revised A question on context-free languages from Sipser's computation book
edited tags
Dec
18
revised Finding equivalent matrix product of a simple quantum circuit
simplified the counterexample a little
Oct
26
revised Finding a pair of edge disjoint paths in a graph, such that the lengths of each one of the paths is smaller than a given constant
linkified; corrected a seeming typo; spelled out ILP
Oct
17
revised How to determine if a graph is 3-colorable, given a way to determine for any graph if removing an edge from that graph gives a 3 colorable graph?
better wording
Oct
15
revised How to determine if a graph is 3-colorable, given a way to determine for any graph if removing an edge from that graph gives a 3 colorable graph?
typo
Oct
5
revised Find the subset of a graph that has the highest minimum spanning tree benefit and a total edge weight within some threshold
improved wording and made other minor edits
Oct
3
revised Finding edges that are not part of any perfect matching
made minor changes
Jul
30
revised Factoring some integer in the given interval
changed wording to clarify the meaning (see the comments)
Jul
26
revised What requirements should a CRC polynomial satisfy?
edited tags
Jul
24
revised Deterministic algorithm for matching variables by only using restricted comparison
added a reference to the paper which posed the problem
Mar
5
revised On existence of an integer between $\sqrt{n}$ and $\sqrt{2n}$ coprime to $n$
moved the clarification to an earlier place
Mar
5
revised On existence of an integer between $\sqrt{n}$ and $\sqrt{2n}$ coprime to $n$
clarified “simple”
Feb
28
revised Are there any known barriers to some approach for solving P vs. NP?
rewrote the proof to make it less sloppy and more readable
Feb
28
revised Are there any known barriers to some approach for solving P vs. NP?
corrected the definition of k-truth-table reduction
Feb
28
revised Are there any known barriers to some approach for solving P vs. NP?
added a proof of the equivalence between NP ⊈ P-close and P≠NP
Feb
27
revised Are there any known barriers to some approach for solving P vs. NP?
added a couterargument to the claimed proof that NP ⊆ P-close ⇒ P=NP
Feb
27
revised Are there any known barriers to some approach for solving P vs. NP?
added 240 characters in body; added 2 characters in body; deleted 1 characters in body; deleted 13 characters in body