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 time-complexity
Search options not deleted
user 23327
The amount of time resources (number of atomic operations or machine steps) required to solve a problem expressed in terms of input size. If your question concerns algorithm analysis, use the [runtime-analysis] tag instead. If your question concerns whether or not a computation will *ever* finish, use the [computability] tag instead. Time-complexity is perhaps the most important sub-topic of complexity theory.
0
votes
0
answers
35
views
Time complexity of finding a fixed-size matching in a hypergraph
Define a size $k$ matching in a hypergraph $H = (V,E)$ to be a collection of $k$ pairwise disjoint edges in $E$. Is anyone aware of the (best-known) time complexity of finding, for fixed $k$, a size $ …
- 309
2
votes
2
answers
287
views
On the time complexity of finding independent sets in hypergraphs
I am interested in the complexity of the following problems:
(a) Finding an independent set of a fixed size in an arbitrary hypergraph
(b) Finding an independent set of maximum size in an arbitrary h …
- 309
1
vote
0
answers
203
views
Time complexity of an algorithm for finding a cycle of fixed length
I am considering the following algorithm for obtaining a cycle $C_k$ of fixed length $k$ in an undirected graph $G$. Assuming $G$ is in adjacency list form, say $r \in G$ is the root for a truncated D …
- 309