user avatar
user avatar
user avatar
Peter Taylor
  • Member for 11 years, 5 months
  • Last seen more than 2 years ago
  • Spain
15 votes

What is the most efficient way to generate a random permutation from probabilistic pairwise swaps?

13 votes
Accepted

For which graphs is the DFS tree always a path?

8 votes
Accepted

Help on the following combinatorial problem?

6 votes

A special class of languages: “circular” languages. Is it known?

6 votes
Accepted

Covering a set of intervals

5 votes

Finding twin vertices in graphs

5 votes
Accepted

Deciding whether a graph contains a complete balanced bipartite graph

4 votes
Accepted

How hard is recognizing a permutation that is a square for the shift product?

4 votes
Accepted

Was Babbage's Analytical Engine really turing-complete?

2 votes

Is any related work to this m-trails problem ?

2 votes

Binary multiplication and parity convolution

2 votes

Practical/heuristic algorithm for multi set-cover

2 votes

How can algorithms with nested combinatorial searches be quasi-linear?

1 vote
Accepted

Enumerating set combinations in an order that maximises the number of previously unseen subsets

1 vote

Finding all cycles

1 vote

Formalizing and optimizing constraints involving booleans, pairs of booleans, and integer sums

0 votes

Route existence between n pairs of nodes

0 votes

Enumerate all allocations of points in a simplex

0 votes

Constructing integer sets in which a certain equation has no solution