Theoretical Computer Science Stack Exchange

37 votes

8 answers

4k views

Efficient and simple randomized algorithms where determinism is difficult

ds.algorithms randomized-algorithms derandomization

mercury0114

121

answered 15 hours ago

0 votes

1 answer

217 views

A k-approximation to k-way number partitioning

approximation-algorithms partition-problem

CommunityBot

1

modified 21 hours ago

0 votes

1 answer

38 views

Is logic in computation of computation constructivist?

cc.complexity-theory linear-logic

Philip White

5,084

answered 21 hours ago

4 votes

1 answer

1k views

Knapsack with dependent profits (pairs of items)

ds.algorithms optimization

CommunityBot

1

modified 22 hours ago

2 votes

0 answers

26 views

Reference for cost of translating between regular language formalisms

reference-request regular-language complexity regular-expressions

Denis

7,672

modified 22 hours ago

4 votes

2 answers

268 views

+50

Random self reducibility and NP

np-hardness complexity-classes reductions

Meir Maor

404

answered yesterday

-2 votes

1 answer

86 views

Algorithm to find all combinations

combinatorics

Philip White

5,084

answered yesterday

-1 votes

1 answer

38 views

Polytime reduction to factoring variant of subset sum

cc.complexity-theory np-hardness reductions factoring

Philip White

5,084

answered yesterday

-1 votes

0 answers

57 views

Selling CS-related game-theory/AI intellectual property to a firm

gt.game-theory ai.artificial-intel career

Philip White

5,084

asked yesterday

0 votes

2 answers

255 views

Solving 3-SAT in O(n^6)?

sat polynomial-time upper-bounds

Bapcap

11

answered yesterday

0 votes

0 answers

36 views

Are there good analogues to Sparsest Cut/Balanced cut for vertex separators instead of edges cuts?

ds.algorithms graph-theory graph-algorithms approximation-algorithms

Julien Codsi

1

modified yesterday

1 vote

1 answer

81 views

Can a collection of quantum circuits be calculated in superposition state?

quantum-computing quantum-information

CommunityBot

1

modified 2 days ago

2 votes

1 answer

186 views

About estimating escape time of gradient Langevin dynamics

lg.learning stochastic-process online-learning

CommunityBot

1

modified Aug 13 at 1:09

6 votes

0 answers

121 views

Computing Sequences with Addition Chains In pseudopolynomial time?

np-hardness np-complete

Alexey Milovanov

1,665

modified Aug 12 at 16:30

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our questions

Efficient and simple randomized algorithms where determinism is difficult

A k-approximation to k-way number partitioning

Is logic in computation of computation constructivist?

Knapsack with dependent profits (pairs of items)

Reference for cost of translating between regular language formalisms

Random self reducibility and NP

Algorithm to find all combinations

Polytime reduction to factoring variant of subset sum

Selling CS-related game-theory/AI intellectual property to a firm

Solving 3-SAT in O(n^6)?

Are there good analogues to Sparsest Cut/Balanced cut for vertex separators instead of edges cuts?

Can a collection of quantum circuits be calculated in superposition state?

About estimating escape time of gradient Langevin dynamics

Computing Sequences with Addition Chains In pseudopolynomial time?

Hot Network Questions