Top Questions

active 1featured hot week month
0
votes
0
answers
3
views

Recursive Relation Help for dinamic programming 2d Plane algorithm

dynamic-algorithms recursive
2m ago Chris Topher 1
7
votes
1
answer
88
views

Complexity class associated with exhaustive search

cc.complexity-theory ds.algorithms reference-request
33m ago Ryan Williams 12.3k
0
votes
0
answers
20
views

Least fixed point logic is efficiently $\operatorname{P}$-bounded for $\operatorname{P} \Leftrightarrow L_\leq$ is a logic for $\operatorname{P}$

cc.complexity-theory lo.logic descriptive-complexity
1h ago joachim 169
9
votes
1
answer
149
views

Why are perfect graphs called perfect?

graph-theory co.combinatorics terminology graph-colouring
2h ago vzn 2,494
0
votes
0
answers
36
views

Polynomial time algorithm for deciding the graphs isomorphism problem! Truth or Fiction? [closed]

graph-isomorphism
2h ago Hooman 220
2
votes
1
answer
31
views

a) selfApp :: Bad a -> a selfApp (x@(C x')) = x' x yc :: (a -> a) -> a yc f = selfApp ...">“Guarded” negative occurrences in definition of inductive types, always bad?

type-theory soundness
5h ago Andrej Bauer 6,187
7
votes
1
answer
64
views

Minimum weight expander

ds.algorithms reference-request graph-theory approximation-algorithms expanders
12h ago Jagadish 927
2
votes
1
answer
76
views

Coupon collector - the effect of randomization

pr.probability randomness randomized-algorithms
13h ago Neal Young 806
14
votes
6
answers
424
views

Efficient and simple randomized algorithms where determinism is difficult

randomized-algorithms
13h ago Jagadish 927
2
votes
0
answers
283
views

Does L=P imply any new complexity class separations?

cc.complexity-theory p-vs-np
16h ago Community♦ 1
6
votes
1
answer
145
views

Computing power sums

ds.algorithms co.combinatorics universal-computation
20h ago D.W. 313
-3
votes
0
answers
44
views

20 Question neural networks [closed]

ai.artificial-intel ne.neural-evol
22h ago cobie 93
-2
votes
0
answers
14
views

Lambda calculus outside functional programming? [migrated]

lambda-calculus functional-programming
1d ago AzaraT 1
19
votes
1
answer
357
views
+50

Natural CLIQUE to k-Color reduction

cc.complexity-theory graph-theory np-hardness reductions
1d ago vzn 2,494
2
votes
1
answer
59
views

Independent iterations in Las Vegas algorithms

reference-request randomized-algorithms
1d ago Suresh Venkat♦ 17.7k
6
votes
0
answers
72
views

Sum-of-squares proof system

cc.complexity-theory lo.logic proof-complexity
1d ago Anonymous 31
-2
votes
1
answer
54
views

Difference between 'Reductions' in algebraic problems vs “Reductions” in Computational Intractability

cc.complexity-theory np-hardness reductions
1d ago William Macrae 56
-1
votes
0
answers
14
views

knnsearch using examples

clustering st.statistics near-neighbors
1d ago mrgloom 1
5
votes
0
answers
80
views

The complexity of the puzzle game Net

reference-request np-hardness puzzles
1d ago Marzio De Biasi 4,093
29
votes
1
answer
636
views

Toy Examples for Plotkin-Shmoys-Tardos and Arora-Kale solvers

ds.algorithms approximation-algorithms linear-programming primal-dual semidefinite-programming
1d ago Neal Young 806
14
votes
2
answers
195
views

The motivation for using Karp-reductions in the theory of $\mathcal{NP}$-completeness

cc.complexity-theory np-hardness soft-question
2d ago Kaveh♦ 7,994
1
vote
0
answers
77
views

Are randomly generated infinite patterns computable?

computability randomness universal-computation stochastic-process
2d ago Squark 206
10
votes
1
answer
Related searches:
theory answer request reference selfapp
gipoco.com is neither affiliated with the authors of this page nor responsible for its contents. This is a safe-cache copy of the original web site.