G. Bach
  • Member for 8 years, 11 months
  • Last seen more than a week ago
3 answers
9 votes
238 views
Constructive version of decidability?
2 answers
6 votes
2k views
1 bookmarks
Algorithm: ordering non-overlapping intervals
1 answers
5 votes
89 views
2 bookmarks
Complexity of covering subset of the monoid $(\{0,1\}^n, \text{OR})$
1 answers
4 votes
328 views
1 bookmarks
C(++) library for DFAs - free for academic use
1 answers
4 votes
135 views
1 bookmarks
Number of rounds in interactive proofs - Arora & Barak
1 answers
3 votes
130 views
Offline scheduling fully determined arbitrary jobs in multiprocessor setting
0 answers
3 votes
205 views
Efficient update to rational flow network?
1 answers
3 votes
147 views
Simplest argument that language decidable in constant time cannot be $\mathsf{NP}$-hard?
1 answers
3 votes
985 views
2 bookmarks
Space(n) not closed under Karp reductions - what about NTime(n)?
1 answers
2 votes
172 views
Modeling $(x > 0 \wedge y > 0) \Leftrightarrow z > 0$ in a linear program: impossible?
0 answers
2 votes
117 views
Max Flow on low depth DAGs
1 answers
2 votes
659 views
1 bookmarks
Simplest way to check edge set for transitivity
1 answers
1 votes
103 views
Generating all factorials up to $n$: faster than naive approach?
1 answers
1 votes
154 views
Set of $\mathsf{NP}$-hard languages closed under set inclusion?