Network profile

David Harris

Reputation

3,380

3.4k
3.3k
3.1k

2017
2018
2019
2020

Top tag

cc.complexity-theory

Next privilege

5,000 Rep.

Approve tag wiki edits

Badges

Newest

Next badge

0/1

Impact

0 posts edited

1 helpful flag

69 votes cast

24 Questions

Votes Activity Newest Views

votes

answers

383

views

Under what circumstances do $O(n^{a + \epsilon})$ algorithms imply $O(n^{a+o(1)})$ algorithms?

cc.complexity-theory asymptotics

Oct 24 '12 at 5:18 Yuval Filmus 14k

votes

answers

views

Definition of matrix-multiplication exponent $\omega$

ds.algorithms linear-algebra

Nov 29 '11 at 23:16 Robin Kothari 12.9k

votes

answers

views

Memory requirement for fast matrix multiplication

ds.algorithms linear-algebra

Nov 23 '16 at 11:29 Community♦ 1

votes

answers

696

views

Computational hardness of “real” computer programs

computability

Sep 29 '11 at 9:03 Neel Krishnaswami 29.7k

votes

answers

405

views

A subset lookup algorithm

ds.algorithms ds.data-structures

Mar 5 '12 at 16:17 A T 556

votes

answers

464

views

Exponential time hypothesis for random algorithms

cc.complexity-theory randomized-algorithms

Sep 21 '15 at 11:50 David Harris 3,380

votes

answer

266

views

$k$-wise independent probability spaces

pr.probability limited-independence

Apr 3 '14 at 9:54 Marc Bury 1,338

votes

answer

views

Algorithms for finding clique in bounded-degree graph

graph-algorithms

Oct 19 '13 at 5:39 Austin Buchanan 2,151

votes

answers

152

views

RAM simulating another RAM

cc.complexity-theory

Jul 15 '11 at 10:50 David Harris 3,380

votes

answers

170

views

Testing $H$ a topological minor of $G$ — algorithms that scale with $H$?

graph-algorithms

Feb 19 '14 at 18:04 Dibyayan 1,006

votes

answer

643

views

Numerically stable fast convolution algorithm?

ds.algorithms na.numerical-analysis

Aug 9 '12 at 21:05 Raphael 151

votes

answers

104

views

Evaluate polynomial involving nearly-minimal graph cuts

ds.algorithms graph-theory graph-algorithms

Jan 10 '12 at 19:35 David Harris 3,380

votes

answers

125

views

Truncated convolution algorithm

ds.algorithms fourier-analysis

Aug 16 '12 at 13:11 David Harris 3,380

votes

answer

583

views

$O(m+n)$ really necessary for graph algorithms?

ds.algorithms terminology asymptotics

Aug 14 '12 at 6:28 SamM 1,397

votes

answers

116

views

Set cover approximation ratio as a function of m (number of sets)

approximation-hardness set-cover

May 18 '15 at 12:58 David Harris 3,380

votes

answers

153

views

Algorithm (parallel and serial) for Gram-Schmidt

ds.algorithms linear-algebra dc.parallel-comp

Aug 1 '14 at 16:03 Community♦ 1

votes

answer

350

views

Parallel (NC) replacements for Gaussian elimination?

cc.complexity-theory complexity-classes linear-algebra dc.parallel-comp matrices

Mar 21 '14 at 15:51 Kaveh 20.8k

votes

answer

322

views

Algorithms with multiple right answers — complexity theory terminology

cc.complexity-theory

Jul 25 '13 at 19:10 Kaveh 20.8k

votes

answers

views

Complexity of counting codeword length distribution

coding-theory

Mar 22 '14 at 13:27 David Harris 3,380

votes

answer

252

views

Generate random permutation via iid uniforms — is inverse transformation possible?

ds.algorithms randomized-algorithms pr.probability

Mar 12 '12 at 15:46 Suresh Venkat 31.2k

vote

answer

views

Inequality for p-norm of probability distributions

pr.probability

Jul 15 '15 at 0:55 usul 6,324

vote

answers

views

NC algorithm for rank of skinny matrix

linear-algebra dc.parallel-comp

Oct 17 '14 at 18:16 David Harris 3,380

vote

answers

143

views

Unwinding a data structure to a previous state

ds.algorithms

Jul 14 '11 at 18:04 David Harris 3,380

votes

answers

131

views

Approximation algorithms based on relaxing a feasible to infeasible solution?

ds.algorithms approximation-algorithms

Feb 9 '12 at 22:06 David Harris 3,380

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

24 Questions

Under what circumstances do $O(n^{a + \epsilon})$ algorithms imply $O(n^{a+o(1)})$ algorithms?

Definition of matrix-multiplication exponent $\omega$

Memory requirement for fast matrix multiplication

Computational hardness of “real” computer programs

A subset lookup algorithm

Exponential time hypothesis for random algorithms

$k$-wise independent probability spaces

Algorithms for finding clique in bounded-degree graph

RAM simulating another RAM

Testing $H$ a topological minor of $G$ — algorithms that scale with $H$?

Numerically stable fast convolution algorithm?

Evaluate polynomial involving nearly-minimal graph cuts

Truncated convolution algorithm

$O(m+n)$ really necessary for graph algorithms?

Set cover approximation ratio as a function of m (number of sets)

Algorithm (parallel and serial) for Gram-Schmidt

Parallel (NC) replacements for Gaussian elimination?

Algorithms with multiple right answers — complexity theory terminology

Complexity of counting codeword length distribution

Generate random permutation via iid uniforms — is inverse transformation possible?

Inequality for p-norm of probability distributions

NC algorithm for rank of skinny matrix

Unwinding a data structure to a previous state

Approximation algorithms based on relaxing a feasible to infeasible solution?