@Gilles , is ok on C se to ask solution of a given problem ?
I have specific two situations, one I can handle, one I dont, I would like ask about the part I dont. Would that be off topic under algorithm, graph tag ?
it is a link!! it says "You are claiming to have a solution for a well-known, difficult open problem. This is [an extraordinary claim requiring extraordinary evidence" I never claimed anything 'extraordinary' and I am not going to , I am going to ask a part of a problem which I am facing at the moment...... probably , i should not post that either.\
@Jim Only you know what you are going to post. In case you want to claim a poly-time algorithm for graph isomorphism, that link applies. Hence: be careful.
There are lots of questions about how to analyze the running time of algorithms (see, e.g., runtime-analysis and algorithm-analysis). Many are similar, for instance those asking for a cost analysis of nested loops or divide & conquer algorithms, but most answers seem to be tailor-made.
On the o...
@NMO "Its complexity" is not a well-defined term. Which cost measure do you investigate? Worst- or average-case runtime or number of executed statements x? Maximum used space? Code size? Energy consumption? And so on. But for each cost measure, every (deterministic) algorithm induces a function from input to value, yes.
@Raphael thanks for your answer. I will try to explain better why I asked this question. I was thinking about P vs NP (I know it a threshed issue haha), my idea is the following. We could associate each algorithm to a function. In the case of algorithms for NP problems we could approximate this by a Taylor Polynomials. Then we could find the algorithm associated to that Taylor Polynomials. This in the hypothetical world where there is a bijective function relating algorithms and functions.
@Raphael I didn't wanted to make this a real question becuase I know it is Drunk Talk and nonsense at all. haha
yes your ideas are "sketchy" to say the least, but coincidentally was just looking at a Q somewhat related to this (ie its not a totally crazy concept). the search is through TMs though instead of math fns.
I am quite certain that I am not the first to entertain the idea that I am going to present. However, it would be helpful if I can find any literature related to the idea.
The idea is to construct a Turing Machine M with the property that if P=NP then M will solve 3-SAT in polynomial time. (Th...
> Facebook has awarded $100,000 to a team of researchers from Georgia Tech for their discovery of a new method for identifying "bad-casting" vulnerabilities that affect programs written in C++.
I am quite certain that I am not the first to entertain the idea that I am going to present. However, it would be helpful if I can find any literature related to the idea.
The idea is to construct a Turing Machine M with the property that if P=NP then M will solve 3-SAT in polynomial time. (Th...
