Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semil...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Jonsson, Peter [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2016transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
17 |
|---|
| Übergeordnetes Werk: |
Enthalten in: 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER - 2011, JCSS, San Diego, Calif. [u.a.] |
|---|---|
| Übergeordnetes Werk: |
volume:82 ; year:2016 ; number:5 ; pages:912-928 ; extent:17 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.jcss.2016.03.002 |
|---|
| Katalog-ID: |
ELV035599928 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV035599928 | ||
| 003 | DE-627 | ||
| 005 | 20230625204907.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180603s2016 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.jcss.2016.03.002 |2 doi | |
| 028 | 5 | 2 | |a GBV00000000000015.pica |
| 035 | |a (DE-627)ELV035599928 | ||
| 035 | |a (ELSEVIER)S0022-0000(16)00027-1 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 004 | |
| 082 | 0 | 4 | |a 004 |q DE-600 |
| 082 | 0 | 4 | |a 610 |q VZ |
| 082 | 0 | 4 | |a 570 |a 540 |q VZ |
| 100 | 1 | |a Jonsson, Peter |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Constraint satisfaction and semilinear expansions of addition over the rationals and the reals |
| 264 | 1 | |c 2016transfer abstract | |
| 300 | |a 17 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. | ||
| 520 | |a A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. | ||
| 650 | 7 | |a Algorithms |2 Elsevier | |
| 650 | 7 | |a Constraint satisfaction problems |2 Elsevier | |
| 650 | 7 | |a Computational complexity |2 Elsevier | |
| 650 | 7 | |a Semilinear sets |2 Elsevier | |
| 700 | 1 | |a Thapper, Johan |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |t 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER |d 2011 |d JCSS |g San Diego, Calif. [u.a.] |w (DE-627)ELV010661603 |
| 773 | 1 | 8 | |g volume:82 |g year:2016 |g number:5 |g pages:912-928 |g extent:17 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.jcss.2016.03.002 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a SSG-OLC-PHA | ||
| 912 | |a GBV_ILN_39 | ||
| 912 | |a GBV_ILN_62 | ||
| 912 | |a GBV_ILN_90 | ||
| 912 | |a GBV_ILN_120 | ||
| 912 | |a GBV_ILN_127 | ||
| 912 | |a GBV_ILN_227 | ||
| 912 | |a GBV_ILN_2001 | ||
| 912 | |a GBV_ILN_2005 | ||
| 912 | |a GBV_ILN_2007 | ||
| 912 | |a GBV_ILN_2008 | ||
| 912 | |a GBV_ILN_2011 | ||
| 912 | |a GBV_ILN_2015 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_2094 | ||
| 951 | |a AR | ||
| 952 | |d 82 |j 2016 |e 5 |h 912-928 |g 17 | ||
| 953 | |2 045F |a 004 | ||
| author_variant |
p j pj |
|---|---|
| matchkey_str |
jonssonpeterthapperjohan:2016----:osritaifcinnsmlnaepninoadtooet |
| hierarchy_sort_str |
2016transfer abstract |
| publishDate |
2016 |
| allfields |
10.1016/j.jcss.2016.03.002 doi GBV00000000000015.pica (DE-627)ELV035599928 (ELSEVIER)S0022-0000(16)00027-1 DE-627 ger DE-627 rakwb eng 004 004 DE-600 610 VZ 570 540 VZ Jonsson, Peter verfasserin aut Constraint satisfaction and semilinear expansions of addition over the rationals and the reals 2016transfer abstract 17 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. Algorithms Elsevier Constraint satisfaction problems Elsevier Computational complexity Elsevier Semilinear sets Elsevier Thapper, Johan oth Enthalten in Elsevier 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER 2011 JCSS San Diego, Calif. [u.a.] (DE-627)ELV010661603 volume:82 year:2016 number:5 pages:912-928 extent:17 https://doi.org/10.1016/j.jcss.2016.03.002 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_39 GBV_ILN_62 GBV_ILN_90 GBV_ILN_120 GBV_ILN_127 GBV_ILN_227 GBV_ILN_2001 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2011 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2094 AR 82 2016 5 912-928 17 045F 004 |
| spelling |
10.1016/j.jcss.2016.03.002 doi GBV00000000000015.pica (DE-627)ELV035599928 (ELSEVIER)S0022-0000(16)00027-1 DE-627 ger DE-627 rakwb eng 004 004 DE-600 610 VZ 570 540 VZ Jonsson, Peter verfasserin aut Constraint satisfaction and semilinear expansions of addition over the rationals and the reals 2016transfer abstract 17 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. Algorithms Elsevier Constraint satisfaction problems Elsevier Computational complexity Elsevier Semilinear sets Elsevier Thapper, Johan oth Enthalten in Elsevier 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER 2011 JCSS San Diego, Calif. [u.a.] (DE-627)ELV010661603 volume:82 year:2016 number:5 pages:912-928 extent:17 https://doi.org/10.1016/j.jcss.2016.03.002 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_39 GBV_ILN_62 GBV_ILN_90 GBV_ILN_120 GBV_ILN_127 GBV_ILN_227 GBV_ILN_2001 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2011 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2094 AR 82 2016 5 912-928 17 045F 004 |
| allfields_unstemmed |
10.1016/j.jcss.2016.03.002 doi GBV00000000000015.pica (DE-627)ELV035599928 (ELSEVIER)S0022-0000(16)00027-1 DE-627 ger DE-627 rakwb eng 004 004 DE-600 610 VZ 570 540 VZ Jonsson, Peter verfasserin aut Constraint satisfaction and semilinear expansions of addition over the rationals and the reals 2016transfer abstract 17 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. Algorithms Elsevier Constraint satisfaction problems Elsevier Computational complexity Elsevier Semilinear sets Elsevier Thapper, Johan oth Enthalten in Elsevier 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER 2011 JCSS San Diego, Calif. [u.a.] (DE-627)ELV010661603 volume:82 year:2016 number:5 pages:912-928 extent:17 https://doi.org/10.1016/j.jcss.2016.03.002 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_39 GBV_ILN_62 GBV_ILN_90 GBV_ILN_120 GBV_ILN_127 GBV_ILN_227 GBV_ILN_2001 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2011 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2094 AR 82 2016 5 912-928 17 045F 004 |
| allfieldsGer |
10.1016/j.jcss.2016.03.002 doi GBV00000000000015.pica (DE-627)ELV035599928 (ELSEVIER)S0022-0000(16)00027-1 DE-627 ger DE-627 rakwb eng 004 004 DE-600 610 VZ 570 540 VZ Jonsson, Peter verfasserin aut Constraint satisfaction and semilinear expansions of addition over the rationals and the reals 2016transfer abstract 17 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. Algorithms Elsevier Constraint satisfaction problems Elsevier Computational complexity Elsevier Semilinear sets Elsevier Thapper, Johan oth Enthalten in Elsevier 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER 2011 JCSS San Diego, Calif. [u.a.] (DE-627)ELV010661603 volume:82 year:2016 number:5 pages:912-928 extent:17 https://doi.org/10.1016/j.jcss.2016.03.002 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_39 GBV_ILN_62 GBV_ILN_90 GBV_ILN_120 GBV_ILN_127 GBV_ILN_227 GBV_ILN_2001 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2011 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2094 AR 82 2016 5 912-928 17 045F 004 |
| allfieldsSound |
10.1016/j.jcss.2016.03.002 doi GBV00000000000015.pica (DE-627)ELV035599928 (ELSEVIER)S0022-0000(16)00027-1 DE-627 ger DE-627 rakwb eng 004 004 DE-600 610 VZ 570 540 VZ Jonsson, Peter verfasserin aut Constraint satisfaction and semilinear expansions of addition over the rationals and the reals 2016transfer abstract 17 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. Algorithms Elsevier Constraint satisfaction problems Elsevier Computational complexity Elsevier Semilinear sets Elsevier Thapper, Johan oth Enthalten in Elsevier 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER 2011 JCSS San Diego, Calif. [u.a.] (DE-627)ELV010661603 volume:82 year:2016 number:5 pages:912-928 extent:17 https://doi.org/10.1016/j.jcss.2016.03.002 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_39 GBV_ILN_62 GBV_ILN_90 GBV_ILN_120 GBV_ILN_127 GBV_ILN_227 GBV_ILN_2001 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2011 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2094 AR 82 2016 5 912-928 17 045F 004 |
| language |
English |
| source |
Enthalten in 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER San Diego, Calif. [u.a.] volume:82 year:2016 number:5 pages:912-928 extent:17 |
| sourceStr |
Enthalten in 1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER San Diego, Calif. [u.a.] volume:82 year:2016 number:5 pages:912-928 extent:17 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Algorithms Constraint satisfaction problems Computational complexity Semilinear sets |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER |
| authorswithroles_txt_mv |
Jonsson, Peter @@aut@@ Thapper, Johan @@oth@@ |
| publishDateDaySort_date |
2016-01-01T00:00:00Z |
| hierarchy_top_id |
ELV010661603 |
| dewey-sort |
14 |
| id |
ELV035599928 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV035599928</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625204907.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2016 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.jcss.2016.03.002</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBV00000000000015.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV035599928</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0022-0000(16)00027-1</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">570</subfield><subfield code="a">540</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jonsson, Peter</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Constraint satisfaction and semilinear expansions of addition over the rationals and the reals</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Constraint satisfaction problems</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational complexity</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Semilinear sets</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Thapper, Johan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="t">1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER</subfield><subfield code="d">2011</subfield><subfield code="d">JCSS</subfield><subfield code="g">San Diego, Calif. [u.a.]</subfield><subfield code="w">(DE-627)ELV010661603</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:82</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:5</subfield><subfield code="g">pages:912-928</subfield><subfield code="g">extent:17</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.jcss.2016.03.002</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_127</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_227</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2094</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">82</subfield><subfield code="j">2016</subfield><subfield code="e">5</subfield><subfield code="h">912-928</subfield><subfield code="g">17</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">004</subfield></datafield></record></collection>
|
| author |
Jonsson, Peter |
| spellingShingle |
Jonsson, Peter ddc 004 ddc 610 ddc 570 Elsevier Algorithms Elsevier Constraint satisfaction problems Elsevier Computational complexity Elsevier Semilinear sets Constraint satisfaction and semilinear expansions of addition over the rationals and the reals |
| authorStr |
Jonsson, Peter |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV010661603 |
| format |
electronic Article |
| dewey-ones |
004 - Data processing & computer science 610 - Medicine & health 570 - Life sciences; biology 540 - Chemistry & allied sciences |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
004 004 DE-600 610 VZ 570 540 VZ Constraint satisfaction and semilinear expansions of addition over the rationals and the reals Algorithms Elsevier Constraint satisfaction problems Elsevier Computational complexity Elsevier Semilinear sets Elsevier |
| topic |
ddc 004 ddc 610 ddc 570 Elsevier Algorithms Elsevier Constraint satisfaction problems Elsevier Computational complexity Elsevier Semilinear sets |
| topic_unstemmed |
ddc 004 ddc 610 ddc 570 Elsevier Algorithms Elsevier Constraint satisfaction problems Elsevier Computational complexity Elsevier Semilinear sets |
| topic_browse |
ddc 004 ddc 610 ddc 570 Elsevier Algorithms Elsevier Constraint satisfaction problems Elsevier Computational complexity Elsevier Semilinear sets |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
j t jt |
| hierarchy_parent_title |
1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER |
| hierarchy_parent_id |
ELV010661603 |
| dewey-tens |
000 - Computer science, knowledge & systems 610 - Medicine & health 570 - Life sciences; biology 540 - Chemistry |
| hierarchy_top_title |
1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV010661603 |
| title |
Constraint satisfaction and semilinear expansions of addition over the rationals and the reals |
| ctrlnum |
(DE-627)ELV035599928 (ELSEVIER)S0022-0000(16)00027-1 |
| title_full |
Constraint satisfaction and semilinear expansions of addition over the rationals and the reals |
| author_sort |
Jonsson, Peter |
| journal |
1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER |
| journalStr |
1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology 500 - Science |
| recordtype |
marc |
| publishDateSort |
2016 |
| contenttype_str_mv |
zzz |
| container_start_page |
912 |
| author_browse |
Jonsson, Peter |
| container_volume |
82 |
| physical |
17 |
| class |
004 004 DE-600 610 VZ 570 540 VZ |
| format_se |
Elektronische Aufsätze |
| author-letter |
Jonsson, Peter |
| doi_str_mv |
10.1016/j.jcss.2016.03.002 |
| dewey-full |
004 610 570 540 |
| title_sort |
constraint satisfaction and semilinear expansions of addition over the rationals and the reals |
| title_auth |
Constraint satisfaction and semilinear expansions of addition over the rationals and the reals |
| abstract |
A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. |
| abstractGer |
A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. |
| abstract_unstemmed |
A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_39 GBV_ILN_62 GBV_ILN_90 GBV_ILN_120 GBV_ILN_127 GBV_ILN_227 GBV_ILN_2001 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2011 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2094 |
| container_issue |
5 |
| title_short |
Constraint satisfaction and semilinear expansions of addition over the rationals and the reals |
| url |
https://doi.org/10.1016/j.jcss.2016.03.002 |
| remote_bool |
true |
| author2 |
Thapper, Johan |
| author2Str |
Thapper, Johan |
| ppnlink |
ELV010661603 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth |
| doi_str |
10.1016/j.jcss.2016.03.002 |
| up_date |
2024-07-06T17:59:01.940Z |
| _version_ |
1803853487869526016 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV035599928</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625204907.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2016 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.jcss.2016.03.002</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBV00000000000015.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV035599928</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0022-0000(16)00027-1</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">570</subfield><subfield code="a">540</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jonsson, Peter</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Constraint satisfaction and semilinear expansions of addition over the rationals and the reals</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R + = { ( x , y , z ) | x + y = z } , ≤, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R + . This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Constraint satisfaction problems</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational complexity</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Semilinear sets</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Thapper, Johan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="t">1190 poster EVALUATION OF DEFORMABLE IMAGE CO-REGISTRATION IN ADAPTIVE IMRT FOR HEAD AND NECK CANCER</subfield><subfield code="d">2011</subfield><subfield code="d">JCSS</subfield><subfield code="g">San Diego, Calif. [u.a.]</subfield><subfield code="w">(DE-627)ELV010661603</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:82</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:5</subfield><subfield code="g">pages:912-928</subfield><subfield code="g">extent:17</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.jcss.2016.03.002</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_127</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_227</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2094</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">82</subfield><subfield code="j">2016</subfield><subfield code="e">5</subfield><subfield code="h">912-928</subfield><subfield code="g">17</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">004</subfield></datafield></record></collection>
|
| score |
7.402276 |