Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with open-problems
Search options not deleted
user 56094
If it turns out that a problem is equivalent to a known open problem, then the open-problem tag is added. After that, the question essentially becomes, "What is known about this problem? What are some possible ways to approach this problem? What are some ways that people have tried to attack it before, and with what results?"
3
votes
Proposals for polymath projects
Consider a probabilistic graph $G = (V, E)$ where each edge operates (exists) with probability $p$, independent of other edges. We consider a set $S \subseteq E$ to be a state of $G$. We say that $S$ …
13
votes
Proposals for polymath projects
Covering Arrays are combinatorial objects that have applications in Computer Science among other fields, specifically in software and hardware testing.
The definition is a 4-tuple $CA(N;t,k,v)$, where …