Theoretical Computer Science Stack Exchange

0 votes

1 answer

30 views

Decomposing outer product or general rank factorization over $\Bbb F_q$

cc.complexity-theory ds.algorithms linear-algebra matrices algebraic-complexity

CommunityBot

1

modified 2 days ago

2 votes

1 answer

163 views

Maximize a special monotone submodular function - is it easier?

ds.algorithms co.combinatorics approximation-algorithms optimization fixed-parameter-tractable

Chandra Chekuri

6,650

modified May 14 at 15:22

-2 votes

0 answers

13 views

relevance of a large prime number in polynomial rolling hash function

ds.algorithms hash-function

kratos

1

modified May 14 at 10:29

-1 votes

0 answers

37 views

What is the bit complexity for Unitary Matrix multiplication?

ds.algorithms time-complexity

Doddy Pal

1

asked May 11 at 15:55

0 votes

0 answers

53 views

Algorithms with advices of huge precomputed data

ds.algorithms reference-request big-picture

Hiroki Morizumi

689

asked May 2 at 22:59

1 vote

0 answers

22 views

Processing times of different job types on $n$ processors

ds.algorithms

SigmaX

131

asked Apr 28 at 18:50

6 votes

2 answers

223 views

How to show that the median cannot be maintained in $O(1)$ time?

ds.algorithms ds.data-structures data-streams streaming-algorithms streaming

Andreas ZUERCHER

101

modified Apr 27 at 18:17

0 votes

0 answers

30 views

Multi-dimensional 0-1 Knapsack problem with a high number of dimensions

ds.algorithms co.combinatorics approximation-algorithms

lchen

101

asked Apr 19 at 7:58

4 votes

1 answer

1k views

Knapsack with dependent profits (pairs of items)

ds.algorithms optimization

CommunityBot

1

modified Apr 18 at 14:06

5 votes

1 answer

199 views

What's the constant coefficient of the Coppersmith-Winograd algorithm?

ds.algorithms time-complexity

Better late than never

21

answered Apr 18 at 14:05

1 vote

0 answers

45 views

Partition points in the plane

ds.algorithms computational-geometry

TAre

11

asked Apr 12 at 5:16

0 votes

0 answers

38 views

Does the linear algorithm of Farach for sorting suffixes imply a linear algorithm for sorting a special type of a sequence of integers?

ds.algorithms time-complexity ds.data-structures

Alex

1

modified Apr 8 at 15:30

4 votes

3 answers

2k views

Dynamic programming and shortest path problem

ds.algorithms graph-algorithms shortest-path dynamic-programming

Neal Young

8,133

modified Apr 2 at 20:13

6 votes

2 answers

419 views

Confidentiality of "partial private keys" in certificateless public key crypto

ds.algorithms cr.crypto-security

Glorfindel

249

modified Apr 2 at 14:42

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our Questions

Decomposing outer product or general rank factorization over $\Bbb F_q$

Maximize a special monotone submodular function - is it easier?

relevance of a large prime number in polynomial rolling hash function

What is the bit complexity for Unitary Matrix multiplication?

Algorithms with advices of huge precomputed data

Processing times of different job types on $n$ processors

How to show that the median cannot be maintained in $O(1)$ time?

Multi-dimensional 0-1 Knapsack problem with a high number of dimensions

Knapsack with dependent profits (pairs of items)

What's the constant coefficient of the Coppersmith-Winograd algorithm?

Partition points in the plane

Does the linear algorithm of Farach for sorting suffixes imply a linear algorithm for sorting a special type of a sequence of integers?

Dynamic programming and shortest path problem

Confidentiality of "partial private keys" in certificateless public key crypto

Hot Network Questions