Filters








237,843 Hits in 2.5 sec

Linear Satisfiability Preserving Assignments

Kei Kimura, Kazuhisa Makino
<span title="2018-02-27">2018</span> <i title="AI Access Foundation"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4ax4efcwajcgvidb6hcg6mwx4a" style="color: black;">The Journal of Artificial Intelligence Research</a> </i> &nbsp;
., nonempty) satisfiability preserving assignment, we introduce linear satisfiability preserving assignments, which are defined by polyhedral cones in an associated vector space.  ...  In this paper, we study several classes of satisfiability preserving assignments to the constraint satisfaction problem (CSP). In particular, we consider fixable, autark and satisfying assignments.  ...  Algorithms of Finding Linear Satisfiability Preserving Assignments for Integer Linear Systems We consider computing linear satisfiability preserving assignments, especially linear locally fixable assignments  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1613/jair.5658">doi:10.1613/jair.5658</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7vgdevspovhshabqxmgrzlcteq">fatcat:7vgdevspovhshabqxmgrzlcteq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180421110700/http://www.jair.org/media/5658/live-5658-10467-jair.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a2/d6/a2d6dafaa649094ad485a03d69e77e135885f221.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1613/jair.5658"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Linear Satisfiability Preserving Assignments (Extended Abstract)

Kei Kimura, Kazuhisa Makino
<span title="">2018</span> <i title="International Joint Conferences on Artificial Intelligence Organization"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vfwwmrihanevtjbbkti2kc3nke" style="color: black;">Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</a> </i> &nbsp;
., nonempty) satisfiability preserving assignment, we introduce linear satisfiability preserving assignments, which are defined by polyhedral cones in an associated vector space.  ...  In this paper, we study several classes of satisfiability preserving assignments to the constraint satisfaction problem. In particular, we consider fixable, autark and satisfying assignments.  ...  We then define linear satisfiability preserving assignments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.24963/ijcai.2018/797">doi:10.24963/ijcai.2018/797</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ijcai/KimuraM18.html">dblp:conf/ijcai/KimuraM18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/z6elxnblrbdefpjn3tdofdzyma">fatcat:z6elxnblrbdefpjn3tdofdzyma</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190220184240/http://pdfs.semanticscholar.org/2669/48b722d5de3ed8ed308285472041852c5fec.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/26/69/266948b722d5de3ed8ed308285472041852c5fec.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.24963/ijcai.2018/797"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Improved 3LIN Hardness via Linear Label Cover

Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari, Michael Wagner
<span title="2019-09-19">2019</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/gdc7gjvgv5hd7mr5o3uwxvngwu" style="color: black;">International Workshop on Approximation Algorithms for Combinatorial Optimization</a> </i> &nbsp;
, finds an assignment that satisfies atleast ( 1 2 + ε)-fraction of clauses unless NP ⊆ BPP.  ...  We prove that for every constant c and ε = (log n) −c , there is no polynomial time algorithm that when given an instance of 3-LIN with n variables where an (1 − ε)-fraction of the clauses are satisfiable  ...  A. 9:6 Improved 3LIN Hardness via Linear Label Cover Soundness Let x be an assignment that satisfies (1), (2), and (3).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.approx-random.2019.9">doi:10.4230/lipics.approx-random.2019.9</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/approx/HarshaKLT19.html">dblp:conf/approx/HarshaKLT19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vjy5cuwaqbambgcza7ev3gjlu4">fatcat:vjy5cuwaqbambgcza7ev3gjlu4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220307212041/https://drops.dagstuhl.de/opus/volltexte/2019/11224/pdf/LIPIcs-APPROX-RANDOM-2019-9.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/12/96/1296c1eefe97c294d8a9f906bd5ca26aedff6ea9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.approx-random.2019.9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Order-Preserving Pattern Matching Indeterminate Strings

Rui Henriques, Alexandre P. Francisco, Luís M. S. Russo, Hideo Bannai, Marc Herbstritt
<span title="2018-05-11">2018</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cpozivjjrjdjbodfq76vaaxdpm" style="color: black;">Annual Symposium on Combinatorial Pattern Matching</a> </i> &nbsp;
Second, given an indeterminate text string of length n, we show that µOPPM can be efficiently solved in polynomial time and linear space.  ...  Given an indeterminate string pattern p and an indeterminate string text t, the problem of orderpreserving pattern matching with character uncertainties (µOPPM) is to find all substrings of t that satisfy  ...  φ formula is satisfiable, there is a Boolean assignment to the variables that specify an assignment of characters in y, $y, preserving the orders of x (as defined by Leq, Lmax and Lmin).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.cpm.2018.2">doi:10.4230/lipics.cpm.2018.2</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cpm/HenriquesFRB18.html">dblp:conf/cpm/HenriquesFRB18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xi2yf3mcqbhk3fbs2ct7q32h4i">fatcat:xi2yf3mcqbhk3fbs2ct7q32h4i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220126193932/https://drops.dagstuhl.de/opus/volltexte/2018/8708/pdf/LIPIcs-CPM-2018-2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2a/7a/2a7ae1c9fe82c4a9b96a1fbb6df922de4290af62.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.cpm.2018.2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Partial Decoherence of Histories and the Diosi Test [article]

J.J.Halliwell
<span title="2009-04-28">2009</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In the decoherent histories approach to quantum theory, attention focuses on the conditions under which probabilities may be assigned to sets of quantum histories.  ...  Most importantly, it satisfies the Diosi condition. A strengthened Diosi condition is proposed, which partial decoherence narrowly fails, due to an unusual property of inhomogeneous histories.  ...  probability assignment condition to satisfy.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0904.4388v1">arXiv:0904.4388v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fpg4yhfvurgc3erbaiyf7hyxva">fatcat:fpg4yhfvurgc3erbaiyf7hyxva</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-0904.4388/0904.4388.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0904.4388v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Order-Preserving Pattern Matching Indeterminate Strings [article]

Diogo Costa and Luís M. S. Russo and Rui Henriques and Hideo Bannai and Alexandre P. Francisco
<span title="2019-05-07">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Given an indeterminate string pattern p and an indeterminate string text t, the problem of order-preserving pattern matching with character uncertainties (μOPPM) is to find all substrings of t that satisfy  ...  When the text and pattern are determinate strings, we are in the presence of the well-studied exact order-preserving pattern matching (OPPM) problem with diverse applications on time series analysis.  ...  If there is an assignment to y[1..t + 1] in §y that preserves one 1 2SAT problems have linear time and space solutions on the size of the input formula.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1905.02589v1">arXiv:1905.02589v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cgr7vur6jbdtdj4eopxay36v34">fatcat:cgr7vur6jbdtdj4eopxay36v34</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191023104341/https://arxiv.org/pdf/1905.02589v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ad/31/ad3107d17930b8d8a1fc8e719d7edaf78821c7ae.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1905.02589v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Node Query Preservation for Deterministic Linear Top-Down Tree Transducers

Kazuki Miyahara, Kenji Hashimoto, Hiroyuki Seki
<span title="2013-11-20">2013</span> <i title="Open Publishing Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzezkwolyvf33pglm2jldjklca" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a> </i> &nbsp;
We assume a transformation given by a deterministic linear top-down data tree transducer (abbreviated as DLT^V) and an n-ary query based on runs of a tree automaton.  ...  We show that the weak preservation problem is coNP-complete and the strong preservation problem is in 2-EXPTIME.  ...  A tree t is linear if each variable occurs at most once in t. A linear tree in T Σ∪Xn is called an (n-ary) context over Σ. Let C(Σ, Xn) denote the set of n-ary contexts over Σ.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.134.4">doi:10.4204/eptcs.134.4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rljnbnajljaiblaqoulbizqk64">fatcat:rljnbnajljaiblaqoulbizqk64</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813114105/http://homepages.inf.ed.ac.uk/smaneth/ttatt2013/4.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ef/0b/ef0be65d7d65061ad2fb747c97234d28d56718ad.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.134.4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

ILP-based engineering change

F. Koushanfar, J.L. Wong, J. Feng, M. Potkonjak
<span title="">2002</span> <i title="IEEE"> Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324) </i> &nbsp;
We have developed a generic integer linear programming(ILP)based engineering change(EC) methodology. The EC methodology has three components: enabling, fast, and preserving.  ...  while preserving the quality of the initially obtained solution.  ...  truth assignment, S , because the original assignment does not satisfy f11.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/dac.2002.1012751">doi:10.1109/dac.2002.1012751</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bziccxm4bfgwtowyrenrw2d7u4">fatcat:bziccxm4bfgwtowyrenrw2d7u4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171025150314/https://core.ac.uk/download/pdf/20771123.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ac/e4/ace4f9e768cd87658cc94b5ffc5b72a073ff4e7d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/dac.2002.1012751"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

ILP-based engineering change

Farinaz Koushanfar, Jennifer L. Wong, Jessica Feng, Miodrag Potkonjak
<span title="">2002</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bonikunskbdgjicnz3tvcz7334" style="color: black;">Proceedings - Design Automation Conference</a> </i> &nbsp;
We have developed a generic integer linear programming(ILP)based engineering change(EC) methodology. The EC methodology has three components: enabling, fast, and preserving.  ...  while preserving the quality of the initially obtained solution.  ...  truth assignment, S , because the original assignment does not satisfy f11.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/514139.514142">doi:10.1145/514139.514142</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/p7t4bjvqqre2zmvixw7oya34ia">fatcat:p7t4bjvqqre2zmvixw7oya34ia</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171025150314/https://core.ac.uk/download/pdf/20771123.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ac/e4/ace4f9e768cd87658cc94b5ffc5b72a073ff4e7d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/514139.514142"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

ILP-based engineering change

Farinaz Koushanfar, Jennifer L. Wong, Jessica Feng, Miodrag Potkonjak
<span title="">2002</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bonikunskbdgjicnz3tvcz7334" style="color: black;">Proceedings - Design Automation Conference</a> </i> &nbsp;
We have developed a generic integer linear programming(ILP)based engineering change(EC) methodology. The EC methodology has three components: enabling, fast, and preserving.  ...  while preserving the quality of the initially obtained solution.  ...  truth assignment, S , because the original assignment does not satisfy f11.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/513918.514142">doi:10.1145/513918.514142</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/dac/KoushanfarWFP02.html">dblp:conf/dac/KoushanfarWFP02</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/l4i5kmc6rffnzekqos5nghuoea">fatcat:l4i5kmc6rffnzekqos5nghuoea</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171025150314/https://core.ac.uk/download/pdf/20771123.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ac/e4/ace4f9e768cd87658cc94b5ffc5b72a073ff4e7d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/513918.514142"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Probabilistic opinion pooling generalized. Part one: general agendas

Franz Dietrich, Christian List
<span title="">2017</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/camnssxuprevbc2yeve4w3dtku" style="color: black;">Social Choice and Welfare</a> </i> &nbsp;
We show that the same kinds of axioms (independence and consensus preservation) have radically di¤erent implications for di¤erent aggregation problems: linearity for probability aggregation and dictatorship  ...  How can several individuals'probability assignments to some events be aggregated into a collective probability assignment?  ...  P X satisfying independence and consensus preservation is linear. (b) For any non-path-connected (…nite) agenda X, there exists a non-linear pooling function F : P n X !  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00355-017-1034-z">doi:10.1007/s00355-017-1034-z</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bkcesnzm2fed5kfwoqlndfiuhe">fatcat:bkcesnzm2fed5kfwoqlndfiuhe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160626034620/http://www.franzdietrich.net:80/Papers/DietrichList-OpinionPoolingGeneralized-Part1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/30/a3/30a336abfba127bb7bb296a3b8d09089c827e6ce.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00355-017-1034-z"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Query-Number Preserving Reductions and Linear Lower Bounds for Testing

Yuichi YOSHIDA, Hiro ITO
<span title="">2010</span> <i title="Institute of Electronics, Information and Communications Engineers (IEICE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xosmgvetnbf4zpplikelekmdqe" style="color: black;">IEICE transactions on information and systems</a> </i> &nbsp;
path/cycle, 3-dimensional matching and NP-complete generalized satisfiability problems.  ...  We introduce two reductions that preserve the query complexity. One is derived from the gap-preserving local reduction and the other is from the L-reduction.  ...  Denote by S(A) the set of all assignments s : Var(A) → {0, 1} that satisfy A.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1587/transinf.e93.d.233">doi:10.1587/transinf.e93.d.233</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iixwxpiiqneaha362w34z23gfe">fatcat:iixwxpiiqneaha362w34z23gfe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181031232159/https://www.jstage.jst.go.jp/article/transinf/E93.D/2/E93.D_2_233/_pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/63/e8/63e8c17b0fa28b5a303a4caa0309091e85a53031.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1587/transinf.e93.d.233"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Reductions That Preserve Approximability [chapter]

Giorgio Ausiello, Vangelis Th. Paschos
<span title="2018-05-15">2018</span> <i title="Chapman and Hall/CRC"> Handbook of Approximation Algorithms and Metaheuristics, Second Edition </i> &nbsp;
We present in this paper a "tour d'horizon" of the most important approximation-preserving reductions that have strongly influenced research about structure in approximability classes.  ...  truth assignment for ϕ can be easily extended to a satisfying truth assignment for f (τ )).  ...  On the other side, for any truth assignment for ϕ satisfying C i , the following truth assignment for l 4 i is such that the extended truth assignment satisfies exactly seven clauses in C i : if exactly  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1201/9781351236423-14">doi:10.1201/9781351236423-14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uleyk6u4dzhibaz65hwd3wncb4">fatcat:uleyk6u4dzhibaz65hwd3wncb4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180726091106/https://hal.archives-ouvertes.fr/hal-00013654/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/89/e2/89e26e4c0030230bcde93c4cba560d292040bb7a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1201/9781351236423-14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Bijective Mappings of Meshes with Boundary and the Degree in Mesh Processing

Yaron Lipman
<span title="">2014</span> <i title="Society for Industrial &amp; Applied Mathematics (SIAM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/amdwhvj4srb33cknicgjbgvsze" style="color: black;">SIAM Journal of Imaging Sciences</a> </i> &nbsp;
The third set of conditions adds to the second set the requirement that the boundary maps are orientation preserving as-well (with a proper definition of boundary map orientation).  ...  The first set of conditions generalizes classical global inversion theorems to the mesh (piecewise-linear) case.  ...  Naturally, we will need to assume that the assignment A is topologically feasible, namely that there exists an orientation preserving boundary homeomorphism ψ : ∂M → ∂Ω that satisfies the given assignment  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/130939754">doi:10.1137/130939754</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kzk2x7v7kvdhhnj73oazrtgdne">fatcat:kzk2x7v7kvdhhnj73oazrtgdne</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190302100409/http://pdfs.semanticscholar.org/a177/39e44ade02fff406e7c8ff3bff5ca6d94f99.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a1/77/a17739e44ade02fff406e7c8ff3bff5ca6d94f99.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/130939754"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Reductions That Preserve Approximability [chapter]

Giorgio Ausiello, Vangelis Th. Paschos
<span title="2007-05-15">2007</span> <i title="Chapman and Hall/CRC"> Handbook of Approximation Algorithms and Metaheuristics </i> &nbsp;
We present in this paper a "tour d'horizon" of the most important approximation-preserving reductions that have strongly influenced research about structure in approximability classes.  ...  truth assignment for ϕ can be easily extended to a satisfying truth assignment for f (τ )).  ...  On the other side, for any truth assignment for ϕ satisfying C i , the following truth assignment for l 4 i is such that the extended truth assignment satisfies exactly seven clauses in C i : if exactly  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1201/9781420010749.ch15">doi:10.1201/9781420010749.ch15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nozlxe5ra5ar5i2okna55rbwym">fatcat:nozlxe5ra5ar5i2okna55rbwym</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170928060423/https://hal.archives-ouvertes.fr/hal-00013654/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/72/6a/726a5bccfe438904486200d10af67e536fa03abe.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1201/9781420010749.ch15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 237,843 results