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 complexity-theory
Search options not deleted
user 62509
Questions related to the (computational) complexity of solving problems
-3
votes
1
answer
78
views
Is there always a worse algorithm?
Is the following true?
Given a problem with a known algorithm of time complexity $g(n), \exists$ another algorithm to solve said problem with time complexity $f(n). \,\,\, f(n): g(n) = o(f(n)) $ …
- 1,647
0
votes
Types of Time Inconstructible Functions
A candidate for a computable but non-time-constructible function could be based on the Collatz conjecture.
Let $C: \mathbb{N} \to \mathbb{N}$ be defined as the median value (or other appropriate stati …
- 1,647
1
vote
1
answer
31
views
Types of Time Inconstructible Functions
So Wikipedia gives me notions of time and space constructibility and as far as I can tell, the two general definitions used are:
Functions $f: \mathbb{N} \to \mathbb{N}$ such that for all $n \geq n_0 …
- 1,647
-1
votes
2
answers
178
views
Does this problem offer any insight into $P$ vs $NP$
What is the input of a given hash?
The problem can be verified in polynomial time (using a hash that executed in polynomial time), and I suspect that it may be possible to prove that ther …
- 1,647
0
votes
1
answer
327
views
Never Brute Force?
Does there exist a more optimum algorithm to solve every problem than brute force (or an equivalent)?
A brute force algorithm for the purpose of this question is defined as an algorithm of time c …
- 1,647
5
votes
3
answers
12k
views
Complexity of Integer Division
My favourite algorithm textbook: The Algorithm Design Manual S. Skiena.pdf
had this interesting problem:
1-28. [5] Write a function to perform integer division without using either the / or * oper …
- 1,647