Theoretical Computer Science Stack Exchange

5 votes

1 answer

157 views

What can we do with a generic oracle (as opposed to a random one)?

Emil Jeřábek

16.8k

modified 13 hours ago

-1 votes

0 answers

70 views

Proof for Upper Bound on the Size of the Sum of Rational Numbers

Arcade_TryHard

1

asked 2 days ago

1 vote

1 answer

118 views

Are there any algorithms that the brain is better at solving than a regular computer? How would these be found/verified?

Command Master

464

answered Nov 20 at 12:38

-1 votes

0 answers

23 views

Finding an algorithm EF[1,1] and PO division for more than two agents

S. M.

99

asked Nov 19 at 14:25

1 vote

1 answer

237 views

The Complexity of Multi-Objective Optimization

CommunityBot

1

modified Nov 19 at 12:03

0 votes

1 answer

145 views

SAT to k-in-3-SAT reduction

Russell Easterly

549

answered Nov 19 at 2:36

5 votes

1 answer

296 views

Problems complete for non-deterministic PSPACE

Hermann Gruber

5,840

modified Nov 18 at 22:26

1 vote

0 answers

61 views

Crafting ${NP}^{\#P}$-complete problems

Habri

11

asked Nov 16 at 17:32

0 votes

0 answers

15 views

Any value in a formula that calculates (not look up) the 'order' of a 'Independent Edge Set' OR a 'I.E.S.' given an 'order' on complete graphs?

Tim

1

asked Nov 16 at 3:30

3 votes

1 answer

343 views

Intuition on Lupanov's Upper Bound on Circuit Size

Vladimir Lysikov

632

answered Nov 14 at 20:11

-3 votes

1 answer

97 views

Can one do descriptive complexity theory using abstract state machines?

uhbif19

295

modified Nov 12 at 10:00

5 votes

1 answer

480 views

Can Lexicographic BFS be implemented in logspace?

JimN

1,276

modified Nov 8 at 9:37

2 votes

1 answer

172 views

Is counting the union of power sets NP-complete?

Laakeri

1,757

answered Nov 7 at 12:58

46 votes

0 answers

1k views

Problem unsolvable in $2^{o(n)}$ on inputs with $n$ bits, assuming ETH?

CommunityBot

1

modified Nov 5 at 21:43

Stack Exchange Network

Explore our questions

What can we do with a generic oracle (as opposed to a random one)?

Proof for Upper Bound on the Size of the Sum of Rational Numbers

Are there any algorithms that the brain is better at solving than a regular computer? How would these be found/verified?

Finding an algorithm EF[1,1] and PO division for more than two agents

The Complexity of Multi-Objective Optimization

SAT to k-in-3-SAT reduction

Problems complete for non-deterministic PSPACE

Crafting ${NP}^{\#P}$-complete problems

Any value in a formula that calculates (not look up) the 'order' of a 'Independent Edge Set' OR a 'I.E.S.' given an 'order' on complete graphs?

Intuition on Lupanov's Upper Bound on Circuit Size

Can one do descriptive complexity theory using abstract state machines?

Can Lexicographic BFS be implemented in logspace?

Is counting the union of power sets NP-complete?

Problem unsolvable in $2^{o(n)}$ on inputs with $n$ bits, assuming ETH?

Hot Network Questions