Question

Getting a first-order condition of Risk Adverse selection problem

score 69 · Answer 1 · 2026-02-23 15:05:09

69

Views

Getting a first-order condition of Risk Adverse selection problem

Published on 23 Feb 2026 - 15:05

score 32 · Answer 2 · 2026-02-23 15:06:15

32

Views

Complexity of representing all satisfying assignments

Published on 23 Feb 2026 - 15:06

score 78 · Answer 3 · 2026-02-23 15:09:22

78

Views

For which $a,b,c$ is the diophantine quadratic equation $ax^2+bx+c=y^2$ soluble?

Published on 23 Feb 2026 - 15:09

score 271 · Answer 4 · 2026-02-23 15:04:02

271

Views

Is guessing person's name an NP problem example?

Published on 23 Feb 2026 - 15:04

score 133 · Answer 5 · 2026-02-23 15:09:22

133

Views

Is p-dimensional matching with $(p-1)n$ edges NP-hard? What about $3n$ edges?

Published on 23 Feb 2026 - 15:09

score 44 · Answer 6 · 2026-02-23 15:01:20

44

Views

Are two optimization problems equivalent?

Published on 23 Feb 2026 - 15:01

score 74 · Answer 7 · 2026-02-23 15:05:09

74

Views

Does this system of inequalities have a solution?

Published on 23 Feb 2026 - 15:05

score 64 · Answer 8 · 2026-02-23 15:04:37

64

Views

Conjugacy problem in hyperbolic groups: pigeonhole principle

Published on 23 Feb 2026 - 15:04

score 287 · Answer 9 · 2026-04-09 13:36:54

287

Views

How to check the feasibility of standard LMI using Matlab/CVX?

Published on 09 Apr 2026 - 13:36

score 33 · Answer 10 · 2026-02-23 15:03:21

33

Views

How would you design an algorithm to solve this decision problem?

Published on 23 Feb 2026 - 15:03

score 65 · Answer 11 · 2026-02-23 15:04:36

65

Views

Must every Turing-complete language be able to enumerate precisely those algorithms which return a particular value?

Published on 23 Feb 2026 - 15:04

score 297 · Answer 12 · 2026-02-23 15:02:12

297

Views

Multitape Turing Machine - Check input's primality

Published on 23 Feb 2026 - 15:02

score 16 · Answer 13 · 2026-02-23 15:04:01

16

Views

NP-hardness via polynomial time reduction

Published on 23 Feb 2026 - 15:04

score 132 · Answer 14 · 2026-02-23 15:08:14

132

Views

I need to prove that this Harry Potter problem is NP-Hard. To what problem can it be compared for reduction?

Published on 23 Feb 2026 - 15:08

score 56 · Answer 15 · 2026-04-10 19:50:31

56

Views

Satisfiability of Second-Order Logic: Is this Decision Problem Complete for Some Level of the Arithmetical Hierarchy?

Published on 10 Apr 2026 - 19:50

List Question

Getting a first-order condition of Risk Adverse selection problem

Complexity of representing all satisfying assignments

For which $a,b,c$ is the diophantine quadratic equation $ax^2+bx+c=y^2$ soluble?

Is guessing person's name an NP problem example?

Is p-dimensional matching with $(p-1)n$ edges NP-hard? What about $3n$ edges?

Are two optimization problems equivalent?

Does this system of inequalities have a solution?

Conjugacy problem in hyperbolic groups: pigeonhole principle

How to check the feasibility of standard LMI using Matlab/CVX?

How would you design an algorithm to solve this decision problem?

Must every Turing-complete language be able to enumerate precisely those algorithms which return a particular value?

Multitape Turing Machine - Check input's primality

NP-hardness via polynomial time reduction

I need to prove that this Harry Potter problem is NP-Hard. To what problem can it be compared for reduction?

Satisfiability of Second-Order Logic: Is this Decision Problem Complete for Some Level of the Arithmetical Hierarchy?

Trending Questions

Popular # Hahtags

Popular Questions