A reduction from unbounded linear mixed arithmetic problems into bounded problems (Q1799094): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (6 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SMTInterpol / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: z3 / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CVC4 / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MathSAT5 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4298890824 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A reduction from unbounded linear mixed arithmetic problems into bounded problems |
scientific article |
Statements
A reduction from unbounded linear mixed arithmetic problems into bounded problems (English)
0 references
18 October 2018
0 references
linear arithmetic
0 references
integer arithmetic
0 references
mixed arithmetic
0 references
SMT
0 references
linear transformations
0 references
constraint solving
0 references
