Stack Exchange

Hsien-Chih Chang 張顯之

Urbana, IL

finiteplayground.wordpress.com

Age: 26

PhD student in Department of Computer Science, University of Illinois at Urbana-Champaign.

top accounts reputation activity favorites subscriptions
Top Questions
45 votes

Common false beliefs in theoretical computer science

big-list examples asked Dec 7 '10 at 9:11
cstheory.stackexchange.com

38 votes

Why do we consider log-space as a model of efficient computation (instead of polylog-space) ?

cc.complexity-theory space-bounded big-picture asked Dec 1 '10 at 18:20
cstheory.stackexchange.com

31 votes

Efficiently computable function as a counter-example to Sarnak's Mobius conjecture

cc.complexity-theory randomness open-problem nt.number-theory asked Feb 23 '11 at 18:04
cstheory.stackexchange.com

27 votes

Polynomial method for complexity results

cc.complexity-theory reference-request co.combinatorics polynomials asked Nov 8 '10 at 1:45
cstheory.stackexchange.com

17 votes

Deterministic Parallel algorithm for perfect matching in general graphs?

cc.complexity-theory ds.algorithms reference-request graph-algorithms dc.parallel-comp asked Nov 15 '10 at 5:03
cstheory.stackexchange.com

16 votes

Formal representation of rings in computations

ds.algorithms reference-request algebra algebraic-complexity asked Oct 18 '10 at 2:22
cstheory.stackexchange.com

11 votes

Consequences of UP equals NP

cc.complexity-theory complexity-classes conditional-results unique-solution asked Dec 20 '10 at 7:08
cstheory.stackexchange.com

8 votes

Benefits for syntactic and semantic classes

cc.complexity-theory complexity-classes big-picture asked Feb 8 '11 at 6:45
cstheory.stackexchange.com

8 votes

The existence of planar distance preserver?

ds.algorithms reference-request graph-algorithms planar-graphs asked Apr 11 '11 at 17:21
cstheory.stackexchange.com

6 votes

What is the initialization time of a link-cut tree?

ds.algorithms ds.data-structures time-complexity tree dynamic-algorithms asked Nov 24 '10 at 9:44
cstheory.stackexchange.com

1 2

Top Answers
34
Common false beliefs in theoretical computer science
cstheory.stackexchange.com

18
Conditions for NFA universality
cstheory.stackexchange.com

16
Lower Bounds for Data Structures
cstheory.stackexchange.com

14
what is easy for minor-excluded graphs?
cstheory.stackexchange.com

14
Common false beliefs in theoretical computer science
cstheory.stackexchange.com

14
Does LOGLOG = NLOGLOG?
cstheory.stackexchange.com

14
Circle graph visualisation
cstheory.stackexchange.com

13
Logspace algorithms on graphs with bounded tree width
cstheory.stackexchange.com

13
“Overflow” in Extended Euclidean Algorithm
cstheory.stackexchange.com

13
Subexponentially solvable hard graph problems
cstheory.stackexchange.com

13
Finding a prime greater than a given bound
cstheory.stackexchange.com

12
Ramsey's theorem for collections of sets
cstheory.stackexchange.com

12
How do you get a “Physical Intuition” for results in TCS?
cstheory.stackexchange.com

11
Reference for (odd-hole,antihole)-free graphs?
cstheory.stackexchange.com

11
Open problems on the frontiers of TCS
cstheory.stackexchange.com

11
What's the approximation factor of this Max k-Cut approximation?
cstheory.stackexchange.com

11
Drawing graphs of bounded crossing number
cstheory.stackexchange.com

9
Max-cut with negative weight edges
cstheory.stackexchange.com

9
Tree decomposition for planar graphs
cstheory.stackexchange.com

9
Classes of graphs with easy Hamiltonian cycle but NP-hard TSP
cstheory.stackexchange.com

8
Common false beliefs in theoretical computer science
cstheory.stackexchange.com

8
Is this graph transformation unique up to isomorphism? [Answer:NO]
cstheory.stackexchange.com

7
Hardness jumps in computational complexity?
cstheory.stackexchange.com

7
Extensions of Ramsey's theorem: monochromatic but diverse
cstheory.stackexchange.com

7
What is the Complexity Status of Arbitarily Weighted Planar Max Cut?
cstheory.stackexchange.com

6
Spectral techniques for genus of a graph
cstheory.stackexchange.com

6
Finding twin vertices in graphs
cstheory.stackexchange.com

6
What Books Should Everyone Read?
cstheory.stackexchange.com

6
Minimum chordless odd-cycle graph completion: is it NP-hard?
cstheory.stackexchange.com

5
What is the pathwidth of the 3D-grid (mesh or lattice) with sidelength k?
cstheory.stackexchange.com

1 2