Filters








481 Hits in 7.1 sec

A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem [article]

Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
<span title="2015-11-27">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We prove the first lower bound for this model by showing that the integrality gap is unbounded at level Ω(√(n)) even for a variant of the problem that is solvable in O(n log n) time by the Moore-Hodgson  ...  These relaxations have an integrality gap of 2, since the Min-knapsack problem is a special case. No APX-hardness result is known and it is still conceivable that there exists a PTAS.  ...  For every k ≤ n we give an unconstrained n-variate polynomial optimization problem with an objective function f (x) of degree k such that Las k−1 (f (x)) has an integrality gap.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1511.08644v1">arXiv:1511.08644v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/eg564pec2rfahmcux4gao5k4rq">fatcat:eg564pec2rfahmcux4gao5k4rq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200825165528/https://arxiv.org/pdf/1511.08644v1.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/ce/45/ce45e8030ef9c13bf800ad567f3df12b9bbdb6c3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1511.08644v1" 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>

Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations [article]

Denis Aßmann, Frauke Liers, Michael Stingl, Juan C. Vera
<span title="2018-08-30">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The developed methods are approximated through sum of squares polynomials and solved using semidefinite programs.  ...  Deciding robust feasibility and infeasibility is important for gas network operations, which is a nonconvex feasibility problem where the feasible set is described by a composition of polynomials with  ...  Furthermore, the authors would like to thank the anonymous reviewers for their valuable comments and insightful suggestions that improved the quality of the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1808.10241v1">arXiv:1808.10241v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g52euochkjf6hgwwgi6apguxsi">fatcat:g52euochkjf6hgwwgi6apguxsi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200930130013/https://arxiv.org/pdf/1808.10241v1.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/89/9c/899c79cafe1e37c502cd484837e66ce84e020e5a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1808.10241v1" 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>

High Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy and Chvatal-Gomory cuts [article]

Monaldo Mastrolilli
<span title="2019-12-23">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper we present a novel polynomial time SOS hierarchy for 0/1 problems with a custom subspace of high degree polynomials (not the standard subspace of low-degree polynomials).  ...  Moreover, for a class of polytopes (e.g. set covering and packing problems), the resulting SOS hierarchy optimizes in polynomial time over the polytope resulting from any constant rounds of CG-cuts, up  ...  In another paper, the same authors [17] consider a problem that is solvable in O(n log n) time and proved that the integrality gap of the SoS hierarchy is unbounded at level Ω( √ n) even after incorporating  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1709.07966v7">arXiv:1709.07966v7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ns2h3t4qwzaavc6sgdfpcvyuyu">fatcat:ns2h3t4qwzaavc6sgdfpcvyuyu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200320232145/https://arxiv.org/pdf/1709.07966v7.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] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1709.07966v7" 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>

Counting Classes and the Fine Structure between NC 1 and L [chapter]

Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The classes PNC 1 and C=NC 1 , defined by a test for positivity and a test for zero, respectively, of arithmetic circuit families of logarithmic depth, sit in this complexity interval.  ...  The class NC 1 of problems solvable by bounded fan-in circuit families of logarithmic depth is known to be contained in logarithmic space L, but not much about the converse is known.  ...  Given a k × k square matrix A, for S, T ⊆ [k], let A S,T denote the square submatrix of A with exactly the rows in S and columns in T .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-15155-2_28">doi:10.1007/978-3-642-15155-2_28</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hpneqo5t3rgtfm3ss56kegtnmq">fatcat:hpneqo5t3rgtfm3ss56kegtnmq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921235844/http://www-cc.cs.uni-sb.de/media/papers/2010/CountingclassesandthefinestructurebetweenNC1andL.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/a0/af/a0af8e13fbfd462fed04f861ddca31f8be43e999.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-15155-2_28"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

The foundations of spectral computations via the Solvability Complexity Index hierarchy: Part I [article]

Matthew J. Colbrook, Anders C. Hansen
<span title="2020-08-06">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This paper is the first of a two-part series establishing the foundations of computational spectral theory through the Solvability Complexity Index (SCI) hierarchy and has three purposes.  ...  We show that for large classes of partial differential operators on unbounded domains, spectra can be computed with error control from point sampling operator coefficients.  ...  Function SpecGap(n1,n2,Pn 1 APn 1 ) Input : n1, n2 ∈ N, Pn 1 APn 1 the square truncation of the matrix A Output: Γn 2 ,n 1 (A), an approximation to Ξgap(A).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1908.09592v3">arXiv:1908.09592v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3xgz4cpnqnfrzatzpyn5mlhfhy">fatcat:3xgz4cpnqnfrzatzpyn5mlhfhy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200911155005/https://arxiv.org/pdf/1908.09592v3.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/9a/ab/9aabd2d21b542fdb359676a7b028f26327815f1c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1908.09592v3" 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>

The Lanczos algorithm for extensive many-body systems in the thermodynamic limit

N. S. Witte, D. Bessis
<span title="">1999</span> <i title="AIP Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/nwwheyjjk5hnlmj6q5mtpqmmhi" style="color: black;">Journal of Mathematical Physics</a> </i> &nbsp;
In this limit the solution for the limiting Lanczos coefficients are found exactly and generally through two equivalent sets of equations, given initial knowledge of the exact cumulant generating function  ...  We establish rigourously the scaling properties of the Lanczos process applied to an arbitrary extensive Many-Body System which is carried to convergence n to infinity and the thermodynamic limit N to  ...  Acknowledgements One of the authors (NSW) would like to acknowledge the support of a Australian Research Council large Grant whilst this work was performed, and the hospitality of Service de Physique Théorique  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1063/1.533010">doi:10.1063/1.533010</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cglkhzcdjbebtk2klxolskvmhu">fatcat:cglkhzcdjbebtk2klxolskvmhu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090927144217/http://www.ms.unimelb.edu.au/~nsw/publications/WB_1999.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/22/cd/22cd3a36046d9135a59c78323ff6eae4e28c5020.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1063/1.533010"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Counting classes and the fine structure between NC1 and L

Samir Datta, Meena Mahajan, B.V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
<span title="">2012</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
The classes PNC 1 and C = NC 1 , defined by a test for positivity and a test for zero, respectively, of arithmetic circuit families of logarithmic depth, sit in this complexity interval.  ...  The class NC 1 of problems solvable by bounded fan-in circuit families of logarithmic depth is known to be contained in logarithmic space L, but not much about the converse is known.  ...  for their comments and suggestions; these significantly helped improve the presentation of the results.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2011.05.050">doi:10.1016/j.tcs.2011.05.050</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wy7i2fwrurapnphsvrz5bufvjq">fatcat:wy7i2fwrurapnphsvrz5bufvjq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190219171318/https://core.ac.uk/download/pdf/82035197.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/08/64/08648e1d5d197b096be0036f56514d7fd06463bd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2011.05.050"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Proof Complexity Meets Algebra

Albert Atserias, Joanna Ochremiak
<span title="2018-12-20">2018</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3kjjbv4edjbezl2w37ipy5lo5a" style="color: black;">ACM Transactions on Computational Logic</a> </i> &nbsp;
This class is also known to coincide with the class of languages with Sums-of-Squares refutations of sublinear degree, a fact for which we provide an alternative proof.  ...  One of the interesting open problems in this area is whether the analysis of the Sums-of-Squares semidefinite programming hierarchy of proof systems (SOS) could be used to improve over the 87% approximation  ...  then INEQ(A, B) has a Sums-of-Squares refutation of degree d(|A|).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3265985">doi:10.1145/3265985</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hhamzk75vfhrbj4vuf7eo5lzmm">fatcat:hhamzk75vfhrbj4vuf7eo5lzmm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190501151235/https://upcommons.upc.edu/bitstream/handle/2117/110969/LIPIcs-ICALP-2017-110.pdf;jsessionid=175E2F9EA2A452CE8C8AF47D0485B98D?sequence=1" 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/35/f2/35f216082eca3892ccb9c4b0ab7ede5a75eebc55.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3265985"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Complexity, Exactness, and Rationality in Polynomial Optimization [article]

Daniel Bienstock and Alberto del Pia and Robert Hildebrand
<span title="2022-04-14">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems.  ...  Lastly, we show that in fixed dimension, the feasibility problem over a set defined by polynomial inequalities is in NP by providing a simple certificate to verify feasibility.  ...  Another approach is to use the Positivestellensatz and compute an infeasibility certificate using sums of squares hierarchies.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2011.08347v5">arXiv:2011.08347v5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/k2eiijo4hbba5e3w52oeb3iyqq">fatcat:k2eiijo4hbba5e3w52oeb3iyqq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210608212348/https://arxiv.org/pdf/2011.08347v4.pdf" title="fulltext PDF download [not primary version]" 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] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c9/5c/c95c77c70351ab88491b4ea80ce4cf736b2bc0d3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2011.08347v5" 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>

Some Solvable Quantum Mechanical Models and Their Symmetries [article]

Bikashkali Midya
<span title="2013-05-23">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This thesis is focused on some solvable quantum mechanical models and their associated symmetries.  ...  An important aspect of SUSYQM is that a hierarchy of isospectral solvable Hamiltonians, with a relationship between the eigenvalues and eigenfunctions of the different members of the hierarchy, can be  ...  to make the eigenfunctions square integrable one must take a = −m (m = 0, 1, 2, 3...) in which case 1 F 1 (a, b, y) reduces to a polynomial.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1305.5583v1">arXiv:1305.5583v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fk2nbflj25guxok4zlrr56hglm">fatcat:fk2nbflj25guxok4zlrr56hglm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191015042514/https://arxiv.org/pdf/1305.5583v1.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/6a/28/6a282a54e6935ddcf9802e20a8910402e7dedf87.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1305.5583v1" 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>

Probing a Set of Trajectories to Maximize Captured Information

Sándor P. Fekete, Alexander Hill, Dominik Krupke, Tyler Mayer, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips, Domenico Cantone, Simone Faro
<span title="">2020</span> <i title="Schloss Dagstuhl - Leibniz-Zentrum für Informatik"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lz6rlossxffpddtscflx56wpb4" style="color: black;">Symposium on Experimental and Efficient Algorithms</a> </i> &nbsp;
We study a trajectory analysis problem we call the Trajectory Capture Problem (TCP), in which, for a given input set T of trajectories in the plane, and an integer k≥ 2, we seek to compute a set of k points  ...  We study the integrality gap arising from such approaches. We analyze our methods on different classes of data, including benchmark instances that we generate.  ...  ., for the U.S.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.sea.2020.5">doi:10.4230/lipics.sea.2020.5</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/wea/FeketeHKMMPP20.html">dblp:conf/wea/FeketeHKMMPP20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bw4jzh4bwzawlp5tpiiur44cwq">fatcat:bw4jzh4bwzawlp5tpiiur44cwq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201209131536/https://drops.dagstuhl.de/opus/volltexte/2020/12079/pdf/LIPIcs-SEA-2020-5.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/4a/b5/4ab51960a6ed171581ba48dc350a61fc072ed1de.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.sea.2020.5"> <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>

Random Partitions and the Quantum Benjamin-Ono Hierarchy [article]

Alexander Moll
<span title="2017-08-15">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
As Jack polynomials are the quantum stationary states and Stanley's Cauchy kernel (1989) is the reproducing kernel, the random values of the quantum periodic Benjamin-Ono hierarchy in a coherent state  ...  For quantum stationary states, this conserved density is dF_λ(c | ε_2, ε_1) the Rayleigh measure of the profile of a partition λ of anisotropy (ε_2, ε_1) ∈C^2 for ħ = - ε_1 ε_2, ε= ε_1 + ε_2 invariant  ...  If K < ∞, a quantum analog of the Liouville-Arnold theorem for classical integrable Hamiltonian systems holds: the presence of a quantum integrable hierarchy reduces the eigenvalue problem (2.2.3) for  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1508.03063v3">arXiv:1508.03063v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/agw5xrfmfrcj3kkfjxtn5zzinm">fatcat:agw5xrfmfrcj3kkfjxtn5zzinm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191026030438/https://arxiv.org/pdf/1508.03063v3.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/36/49/3649e6ff78408ff147975ac7441b9aa0c626fc48.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1508.03063v3" 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>

Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials [article]

Mareike Dressler and Adam Kurpisz and Timo de Wolff
<span title="2018-02-27">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
One particularly successful way to prove complexity bounds for these types of problems are based on sums of squares (SOS) as nonnegativity certificates.  ...  In this article, we initiate the analysis of optimization problems over the boolean hypercube via a recent, alternative certificate called sums of nonnegative circuit polynomials (SONC).  ...  AK was supported by the Swiss National Science Foundation project PZ00P2 174117 "Theory and Applications of Linear and Semidefinite Relaxations for Combinatorial Optimization Problems".  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1802.10004v1">arXiv:1802.10004v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/v6wtvekburdsrdsnvs7zqnjzcq">fatcat:v6wtvekburdsrdsnvs7zqnjzcq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200917144253/https://arxiv.org/pdf/1802.10004v1.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/af/aa/afaa050b35b8330ee16ab16699f22080bac1bd2b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1802.10004v1" 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>

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges [article]

Robert Bredereck and Jiehua Chen and Piotr Faliszewski and Jiong Guo and Rolf Niedermeier and Gerhard J. Woeginger
<span title="2014-07-08">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Parameterized Algorithmics is a subfield of Theoretical Computer Science seeking to exploit meaningful problem-specific parameters in order to identify tractable special cases of in general computationally  ...  In this paper, we propose nine of our favorite research challenges concerning the parameterized complexity of problems appearing in this context.  ...  We thank Britta Dorn, Dominikus Krüger, Jörg Rothe, Lena Schend, Arkardii Slinko, Nimrod Talmon, and an anonymous referee for their constructive feedback on previous versions of the manuscript.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1407.2143v1">arXiv:1407.2143v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/l7hupjhho5h7jdwes7wxxpmlby">fatcat:l7hupjhho5h7jdwes7wxxpmlby</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191016031020/https://arxiv.org/pdf/1407.2143v1.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/e0/51/e0518e7b1441844aececad6390a33be52a19b063.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1407.2143v1" 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>

Parameterized algorithmics for computational social choice: Nine research challenges

Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger
<span title="">2014</span> <i title="Tsinghua University Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/w77vm44enzh4tgk44gtrsw7f64" style="color: black;">Tsinghua Science and Technology</a> </i> &nbsp;
Parameterized Algorithmics is a subfield of Theoretical Computer Science seeking to exploit meaningful problemspecific parameters in order to identify tractable special cases of in general computationally  ...  In this paper, we propose nine of our favorite research challenges concerning the parameterized complexity of problems appearing in this context.  ...  We thank Britta Dorn, Dominikus Krüger, Jörg Rothe, Lena Schend, Arkardii Slinko, Nimrod Talmon, and an anonymous referee for their constructive feedback on previous versions of the manuscript.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tst.2014.6867518">doi:10.1109/tst.2014.6867518</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hbftzfbi65fq7agrno3nubfz3e">fatcat:hbftzfbi65fq7agrno3nubfz3e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829011529/http://fpt.akt.tu-berlin.de/publications/Parameterized_Algorithmics_for_Computational_Social_Choice__Nine_Research_Challenges.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/42/49/4249b5dba7470a7af04fa33f4b5649cba81b8d1b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tst.2014.6867518"> <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 481 results