Hsien-Chih Chang 張顯之
  • Member for 11 years, 1 month
  • Last seen this week
1 answers
-6 votes
303 views
A policy proposal against questions asking for a correctness check
Accepted answer
10 votes

While problems without a clear demonstration that the author had put effort in are less-motivated for me to answer, the judgement of "the evidence that they have took some work" varies from people to ...

View answer
17 answers
34 votes
2k views
Original proofs generated on the parent site
5 votes

In this post, Peter Shor shows that it is impossible to approximate a max-cut on a (possibly-)negative weighted graph within a factor of 2, unless there is also an approximation algorithm with ratio ...

View answer
8 answers
19 votes
576 views
Design Ideas for TCS Site
4 votes

For 404/error message, could we try something involve a nondeterministic search: In fact the page is founded/the command is succeed. Unfortunately, this is a nondeterministic search/operation and ...

View answer
7 answers
9 votes
229 views
Meta-meta discussion, and voting conventions
3 votes

In my opinion, the major problem is caused by the ambiguity of interpreting the upvotes in meta, which may have the following two different meanings: the question itself is a good one, we should have ...

View answer
2 answers
3 votes
180 views
Community discussion about the Sum of Square Roots problem?
2 votes

Since the site is designed as a Q&A site, I guess it is OK if the question is formulated that a clear single answer exists. As long as the question is in the scope of research-level theoretical ...

View answer
3 answers
5 votes
355 views
Questions for candidates in 2011 community moderator election
2 votes

Here's a question for all the candidates: Promotion is one of the main issue to this site. There has been a lot of discussion on this topic, and our site is (slowly) growing with more active ...

View answer
17 answers
34 votes
2k views
Original proofs generated on the parent site
2 votes

@mjqxxxx provided a reduction from 3-SAT to the fewest discriminating bits problem asked by @andy_fingerhut.

View answer
17 answers
34 votes
2k views
Original proofs generated on the parent site
2 votes

Oleksandr Bondarenko solved a conjecture about degree sets of linear extension graphs by himself.

View answer
17 answers
34 votes
2k views
Original proofs generated on the parent site
2 votes

David Eppstein shows a variant of max-cut problem is NP-hard, which is asked by Aaron.

View answer
3 answers
2 votes
161 views
Nifty PDF snippets
2 votes

I usually do this when posting a figure from pdf; since I'm using Windows, by pressing "printscreen" key on the upper-right part of the keyboard and pasting the screen image to some kind of editor (...

View answer
10 answers
21 votes
483 views
New Design Launched
1 votes

Just a minor issue, the font color of the tags [featured] and [faq] in meta seems to collide with the background color. Maybe using white like [status-completed], or say yellow if we want to emphasize ...

View answer
1 answers
1 votes
153 views
Revisiting questions closed as off-topic
Accepted answer
0 votes

I took a quick glance over all questions in the list with at least 2 up-votes. Maybe the only question with a positive change to be reopened is this: Is Witten's new method of quantization useful ...

View answer