user avatar
user avatar
user avatar
a3nm
  • Member for 11 years, 2 months
  • Last seen more than a week ago
17 votes
Accepted

Proof of the pumping lemma for context-free languages using pushdown automata

9 votes
Accepted

Minimum cost topological ordering

9 votes
Accepted

What are bounded-treewidth circuits good for?

9 votes
Accepted

Characterization of lengths of words accepted by DFAs

7 votes

Generalization of Dilworth's theorem for labeled DAGs

7 votes
Accepted

Worst number of questions needed to learn a monotonic predicate over a poset

5 votes

Binary search generalizations for posets?

4 votes
Accepted

Complexity of counting the number of edge covers of a graph

4 votes

Arranging letters to make a word in a regular language

3 votes

Are research papers hard to read?

3 votes
Accepted

A variant of #POSITIVE-2-DNF

3 votes
Accepted

Constrained Topological Sorting with bounded number of chains

2 votes

Testing whether letters can be scheduled to achieve a word in a regular language

2 votes
Accepted

Generalizing linear interpolation to posets

2 votes
Accepted

Hardness of XSAT

2 votes
Accepted

Find items that are in at least $k$ of $n$ sets

2 votes
Accepted

Generating uniform integers in a range from a random generator with another range

2 votes

Open access journals

2 votes
Accepted

What is the recognition complexity of k-uniform k-partite hypergraphs?

2 votes
Accepted

"Almost sorting" integers in linear time

2 votes
Accepted

Complexity of #PP2DNF where we also count on the number of clauses

2 votes

Is S-T CONNECTEDNESS #P-complete on instances when all s-t paths are of the same length?

2 votes

Proof refutation: Amateur reviews of ambitious CoRR papers

2 votes

Monotone circuit representations of paths in a graph?

2 votes

Baud rates applied to human communication

2 votes

Establishing competing memory limits for pushdown automata

1 vote

Topological sorting of a DAG where special vertices have to come in even groups

1 vote

Finding subgraphs with high treewidth and constant degree

1 vote

Separating words with random DFAs

1 vote

Determining what can be achieved by a permutation of elements of a noncommutative group