Skip to main content
Yaroslav Bulatov's user avatar
Yaroslav Bulatov's user avatar
Yaroslav Bulatov's user avatar
Yaroslav Bulatov
  • Member for 13 years, 10 months
  • Last seen more than a month ago
69 votes

The origin of the notion of treewidth

36 votes

Powerful Algorithms too complex to implement

11 votes

Reverse Graph Spectra Problem?

11 votes

Physics results in TCS?

10 votes

Hardness jumps in computational complexity?

10 votes

Data for testing graph algorithms

10 votes

Fast sparse boolean matrix chain product

8 votes

Counting the number of vertex covers: when is it hard?

8 votes

Graph families which have polynomial time algorithms for computing the chromatic number

7 votes
Accepted

Typical hardness of tree decomposition?

6 votes
Accepted

Have any generalizations of maximum weight matching been studied?

6 votes

Complexity of testing for a value versus computing a function

5 votes

When is relaxed counting hard?

3 votes

Best way to determine if a list of bytes are random?

3 votes

Cubic graphs and hamiltonian paths

1 vote

Ideas for a project in Mathematica related to (Theoretical) Computer Science

1 vote
Accepted

what is the equivalence class of a given polytree representing a directed graphical model?

1 vote

Condition Number dependent algorithms for matrix operations

1 vote
Accepted

Complexity of linearized Ising model at 0