As of May 31, 2023, we have updated our Code of Conduct.
Theoretical Computer Science
Peter Taylor's user avatar
Peter Taylor's user avatar
Peter Taylor's user avatar
Peter Taylor
  • Member for 12 years, 4 months
  • Last seen more than 3 years ago
  • Spain
Profile Activity

19 Answers

Score Activity Newest
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

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.