0
$\begingroup$

Given a system of linear diophanthine equations. What is the computational complexity of checking if the system has a solution or not or finding a solution if we have an additional constraint that none of the values in the solution can be 0.

As far as I know checking if a solution exists if no non zero constraint exists is easy and can be done in a polynomial time.

Improve this question
$\endgroup$
1
  • $\begingroup$ Can someone please help with this? $\endgroup$ Commented Feb 28 at 5:21

0

Reset to default

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.