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 inequalities
Search options not deleted
user 83253
for questions involving inequalities, upper and lower bounds.
2
votes
1
answer
529
views
Complexity of Deciding Feasibility of a system of linear inequalities over restricted variables
If you do this out, you will get a system of linear inequalities as follows:
$$
a_{11}x_0+\cdots+a_{1m}x_{m-1} \geq 0\\\
\vdots \\\
a_{n1}x_0+\cdots+a_{nm}x_{m-1} \geq 0
$$
Question: What is the time … complexity of only deciding whether this system of linear inequalities is feasible, meaning there exists some $\vec{x}\in\left\lbrace 1, -1\right\rbrace^m$ that satisfies the constraints. …
- 21