Unanswered Questions
3,747 questions with no upvoted or accepted answers
-3
votes
1
answer
188
views
Is any procedure satisified by the principle of least action able to be simulated by Turing Machine?
The Hamilton action $S$ is defined as following:
$$S=\int^T_0 L(q,\dot{q})dt$$
the integral along any actual or virtual (conceivable or trial) space-time trajectory q(t)
connects two specified space-...
-4
votes
0
answers
41
views
P va NP regarding
I have discovered a deterministic polynomial time algorithm for generalized n^2 x n^2 Sudoku puzzle, my program can solve any given valid Sudoku puzzle in steps by reasoning almost like a man. The ...
-4
votes
0
answers
69
views
Is P/poly included in NP?
I learned that $\textsf{P/poly}$ is a class of problems computable by a polynomial-size circuit.
This class is considered a class of problems such that there exists a polynomial-time algorithm that is ...
-4
votes
1
answer
561
views
does within the "range a and b" include a and b?
I have not found the answer to this doubt of mine elsewhere, hence posting it here.
It may be a silly question but I just want to be sure :P
would be great if someone could help me out with this ...
-4
votes
1
answer
544
views
Distinguish Graph from Tree using Adjacency Matrix
Given an adjacency matrix, is there a way to determine if the graph will be a tree or a graph (whether or not there is a cycle).
For example, given the adjacency matrix:
...
-4
votes
1
answer
70
views
Proving NP-complete problem
Suppose the following problem:
Given an undirected graph G=(V,E), is it possible to choose a subset V' of vertex set V, such that deleting it removes all triangles (cycles of length 3), where |V'| is ...
-4
votes
1
answer
1k
views
Subset-Sum modulo small primes
I was thinking about the strategy of solving Subset-Sum (with a set of size n and integers having n bits each) by using Dynamic Programming (described here: http://en.wikipedia.org/wiki/...
-4
votes
1
answer
2k
views
Find sentences with similar relative meaning from a list of sentences against an example one
I want to be able to find sentences with the same meaning. I have a query sentence, and a long list of millions of other sentences. Sentences are words, or a special type of word called a symbol which ...
-4
votes
1
answer
889
views
Proving NP-hardness of scheduling problem (total weighted completion time)
Consider the problem $P \mid \mid \sum w_j C_j$. I want to prove that this problem is (strongly) NP-hard by reducing from $3$-Partition, but I am not really sure how to do this.
Just to be precise, ...
-5
votes
1
answer
36
views
Seeking Help to Verify Algorithm for Chromatic Number in Polynomial Time
Recently, I wrote a paper (not published yet) about an algorithm that calculates the chromatic number of any graph in polynomial time. I have mathematical proof to support it, but it needs ...
-5
votes
1
answer
291
views
Some questions (still) unresolved about braids?
I was looking for interesting questions pertaining to braid theory. I don't know if the following are considered important, but I'd like to ask:
(1) in relation with the following link, is it true ...
-5
votes
1
answer
377
views
Attacking TSP via small nonintersecting circuits
Consider the problem of finding smaller "non-intersecting" circuits or paths in graphs embedded in the euclidean plane (visiting all vertices) in the sense of geometric intersections of edges plotted ...