Filters








407,492 Hits in 5.4 sec

Positive Versions of Polynomial Time

C. Lautemann, T. Schwentick, I.A. Stewart
<span title="">1998</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
Grigni and Sipser [17] considered positive versions of a variety of computational models such as boolean circuits, branching programs, and nondeterministic Turing machines and, in a natural way, made them  ...  but not by polynomial-size sequences of boolean circuits in which negation gates do not appear.  ...  SOME DIFFERENT CHARACTERIZATIONS OF P We consider naturally defined positive versions of a variety of characterizations of the complexity class P, polynomial-time, involving extensions of first-order logic  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/inco.1998.2742">doi:10.1006/inco.1998.2742</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vdydd4332vellid2eozlndtluu">fatcat:vdydd4332vellid2eozlndtluu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190327002722/https://core.ac.uk/download/pdf/82761582.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/91/e5/91e51d0ea8b164823645147efa11847d33027252.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/inco.1998.2742"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

New Versions of the Hermite Bieler Theorem in Stability Contexts

Ziad Zahreddine
<span title="">2019</span> <i title="Science Publishing Group"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/djr342i4djhxtcoou3v6ldeb6a" style="color: black;">American Journal of Applied Mathematics</a> </i> &nbsp;
the Hurwitz stability of a real polynomial.  ...  We also look at the problem of stability of discrete-time systems of difference equations.  ...  Let ( ) f z be as defined in (1) and let it represent the characteristic polynomial of a continuous-time system of differential equations.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.11648/j.ajam.20190701.11">doi:10.11648/j.ajam.20190701.11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vy666l45yvbdvkbosncwist754">fatcat:vy666l45yvbdvkbosncwist754</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190712104737/http://article.applmath.org:80/pdf/10.11648.j.ajam.20190701.11.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/45/1c/451c0e9175a3974a555cff12f450f8ff98d1fdf3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.11648/j.ajam.20190701.11"> <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>

Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers [chapter]

Yuanmi Chen, Phong Q. Nguyen
<span title="">2012</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;
We present a new PACD algorithm whose running time is essentially the "square root" of that of exhaustive search, which was the best attack in practice.  ...  There are two versions for these problems: the partial version (PACD) and the general version (GACD).  ...  Part of this work is supported by the Commission of the European Communities through the ICT program under contract ICT-2007-216676 ECRYPT II.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-29011-4_30">doi:10.1007/978-3-642-29011-4_30</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/njp4w45wibdlddi6uza73hay6u">fatcat:njp4w45wibdlddi6uza73hay6u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190418085937/https://core.ac.uk/download/pdf/52627986.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/e5/d7/e5d7f378e809fb1e89eec0cf38d17b50d50b43d4.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-29011-4_30"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

New Approximation Results for Resource Replication Problems [chapter]

Samir Khuller, Barna Saha, Kanthi K. Sarpatwar
<span title="">2012</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;
i.e., with positive approximation ratio) for different versions of the problem.  ...  Our results range from positive (efficient, small constant factor, approximation algorithms) to extremely negative (impossibility of existence of any algorithm with non-trivial approximation guarantee,  ...  We give a polynomial time reduction of the densest k-subgraph [8] to the feasibility version of the general problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-32512-0_19">doi:10.1007/978-3-642-32512-0_19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hun25xj7xjcplbbiy7gxzvcqze">fatcat:hun25xj7xjcplbbiy7gxzvcqze</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20121114194221/http://www.cs.umd.edu/users/samir/grant/approx12.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/75/bc/75bcd8fbfc3b00eb78e3b321d23ed3917d897eff.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-32512-0_19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

New Approximation Results for Resource Replication Problems

Samir Khuller, Barna Saha, Kanthi K. Sarpatwar
<span title="2015-03-10">2015</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qhi3z76be5c5xeihac5cyiid3m" style="color: black;">Algorithmica</a> </i> &nbsp;
i.e., with positive approximation ratio) for different versions of the problem.  ...  Our results range from positive (efficient, small constant factor, approximation algorithms) to extremely negative (impossibility of existence of any algorithm with non-trivial approximation guarantee,  ...  We give a polynomial time reduction of the densest k-subgraph [8] to the feasibility version of the general problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00453-015-9978-9">doi:10.1007/s00453-015-9978-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ccwnjhyr5jcapakfuyo5cxblwy">fatcat:ccwnjhyr5jcapakfuyo5cxblwy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20121114194221/http://www.cs.umd.edu/users/samir/grant/approx12.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/75/bc/75bcd8fbfc3b00eb78e3b321d23ed3917d897eff.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00453-015-9978-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A general approximation method for bicriteria minimization problems

Pascal Halffmann, Stefan Ruzika, Clemens Thielen, David Willems
<span title="">2017</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;
problem whose running time is polynomial in the encoding length of the input and linear in 1/ϵ.  ...  We present a general technique for approximating bicriteria minimization problems with positive-valued, polynomially computable objective functions.  ...  The research of Pascal Halffmann was supported by DFG grant RU 1524/4-1, Stefan Ruzika acknowledges support by DAAD project 57128839, and David Willems' activities were funded by BMBF project 13N12825.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2017.07.003">doi:10.1016/j.tcs.2017.07.003</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zmeabv4rmvdgforfwssfctd6au">fatcat:zmeabv4rmvdgforfwssfctd6au</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191015041526/https://arxiv.org/pdf/1701.02989v1.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/58/c4/58c4b2be95e5e14067db37c909ddd18b14fe412d.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.2017.07.003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Creating Teams of Simple Agents for Specified Tasks: A Computational Complexity Perspective [article]

T. Wareham
<span title="2022-05-04">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Building on recent complexity analyses addressing related questions in swarm robotics, we prove that automated team verification and design are by large both exact and approximate polynomial-time intractable  ...  in general for the most basic types of homogeneous and heterogeneous teams consisting of simple agents that communicate indirectly.  ...  in polynomial time.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2205.02061v1">arXiv:2205.02061v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ifyukml3yvfmhjv3jwd3z5hg2e">fatcat:ifyukml3yvfmhjv3jwd3z5hg2e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220507082746/https://arxiv.org/pdf/2205.02061v1.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/37/09/3709935b9a25cfa4f3a19734eb3e67458868ff79.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2205.02061v1" 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>

2D Barcode Image Decoding

Jeng-An Lin, Chiou-Shann Fuh
<span title="">2013</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wpareqynwbgqdfodcyhh36aqaq" style="color: black;">Mathematical Problems in Engineering</a> </i> &nbsp;
Moreover, we evaluate the execution time for different-size images. Our method can decode these images in real time.  ...  Barcode technology is one of the most important parts of Automatic Identification and Data Capture (AIDC). Quick Response code (QR code) is one of the most popular types of two-dimensional barcodes.  ...  Error locator polynomial can be used to find the error positions. Error evaluator polynomial is used to find the error values.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2013/848276">doi:10.1155/2013/848276</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jaj54k7csrhvzgrom7eelddtcu">fatcat:jaj54k7csrhvzgrom7eelddtcu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190426213612/http://downloads.hindawi.com/journals/mpe/2013/848276.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/86/90/8690c581c28bae8a4797033beb383aefb7f9b518.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2013/848276"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

Computing the minimum diameter for moving points

Jörg Schwerdt, Michiel Smid, Stefan Schirra
<span title="">1997</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqbrzpfj5rc3pcxpllbrit3n4q" style="color: black;">Proceedings of the thirteenth annual symposium on Computational geometry - SCG &#39;97</a> </i> &nbsp;
The position of point p at time t is then p(t) = (x, y) + t (vx, vy). For each value of n we created 10 different example point sets.  ...  They first compute the positions of the points at time t. Then they compute all diametral pairs, i.e., all pairs p, q such that Zpq(t) = D 2 (t).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/262839.263087">doi:10.1145/262839.263087</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/compgeom/SchwerdtSS97.html">dblp:conf/compgeom/SchwerdtSS97</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/t2ja6mtdcjcs7ije7qwr5hjoua">fatcat:t2ja6mtdcjcs7ije7qwr5hjoua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321114750/http://people.scs.carleton.ca/~michiel/paramsearch.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/c8/60/c860a0c21656ac1e65c85a771092489e3d7e73f4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/262839.263087"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

The Capacity Expansion Path Problem in Networks

Jianping Li, Juanping Zhu
<span title="">2013</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xdzjuti5nzejrghubfpezefpqi" style="color: black;">Journal of Applied Mathematics</a> </i> &nbsp;
Furthermore, we investigate two special versions of the GCEP problem.  ...  For the minimum number arc capacity expansion path problem (MN-CEP), we give a strongly polynomial algorithm based on the dynamic programming.  ...  Acknowledgment The work is fully supported by the National Natural Science Foundation of China [no. 11126355, 61063011].  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2013/156901">doi:10.1155/2013/156901</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vi6zfqo3cva2zkcssidctzu6fy">fatcat:vi6zfqo3cva2zkcssidctzu6fy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190226153058/http://pdfs.semanticscholar.org/807a/377a5d8103eccddbeaaa9f3dd8cca0707943.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/80/7a/807a377a5d8103eccddbeaaa9f3dd8cca0707943.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2013/156901"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

The Complexity of Approximating the Complex-Valued Potts Model

Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos, Daniel Kráľ, Javier Esparza
<span title="2020-08-18">2020</span> <i title="Schloss Dagstuhl - Leibniz-Zentrum für Informatik"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5b35w7jagjckfngb6pj76nbam4" style="color: black;">International Symposium on Mathematical Foundations of Computer Science</a> </i> &nbsp;
We study the complexity of approximating the partition function of the q-state Potts model and the closely related Tutte polynomial for complex values of the underlying parameters.  ...  zeros, is strongly connected with the complexity of the approximation problem, even for positive real-valued parameters.  ...  Our planar results for the Tutte polynomial allow us to adapt the argument in [11] to answer the question asked in [6] , see Corollary 62 of the full version.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.mfcs.2020.36">doi:10.4230/lipics.mfcs.2020.36</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/mfcs/GalanisGH20.html">dblp:conf/mfcs/GalanisGH20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ux7zybhsxvgezohy5puqoseeem">fatcat:ux7zybhsxvgezohy5puqoseeem</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201209160921/https://drops.dagstuhl.de/opus/volltexte/2020/12703/pdf/LIPIcs-MFCS-2020-36.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/a8/86/a886994c7b43c888ac4339dcf3610e2eb25ac232.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.mfcs.2020.36"> <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>

Cumulative subject index volumes 68–71

<span title="">1986</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fbkexx2qg5anljkxraobuswdq4" style="color: black;">Information and Control</a> </i> &nbsp;
Aggregation problems, formulation of several versions, analysis from recursion theoretic point of view, 70, 69 Algorithms for circular retrieval and k-nearest neighbor search problems, description and  ...  analysis, 68, 105 for computing properties and functions of n-node forest stored in processor mesh, 69, 168 deterministic, applications to optimal parallel list ranking, 70, 32 network resource allocation  ...  sets, position of corresponding index sets in arithmetical hierarchy, 68, 185 symmetric, computable by constant-depth polynomial-size sequences of boolean circuits, characterization, 70, 216 Database  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(86)80014-6">doi:10.1016/s0019-9958(86)80014-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hkligygazvcyvdgrhtvhrefpj4">fatcat:hkligygazvcyvdgrhtvhrefpj4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190417035629/https://core.ac.uk/download/pdf/82354262.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/fc/26/fc26ce6992f5100a3d78c47e32ba7eaee8c5b724.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(86)80014-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

The role of no-arbitrage on forecasting: Lessons from a parametric term structure model

Caio Almeida, José Vicente
<span title="">2008</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2iglomp5yretdktcylcl36psim" style="color: black;">Journal of Banking &amp; Finance</a> </i> &nbsp;
We construct cross section (allowing arbitrages) and arbitrage-free versions of a parametric polynomial model to analyze how well they predict out-of-sample interest rates. Based on U.S.  ...  Furthermore, a decomposition of forecasts into forward-rates and holding return premia indicates that the superior performance of no-arbitrage versions is due to a better identification of bond risk premium  ...  This table presents bias (first number in each cell) and RMSE (second number in each cell) for 1-month, 6-month and 12-month ahead out-of-sample forecasts, for the three versions of the polynomial model  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jbankfin.2008.07.003">doi:10.1016/j.jbankfin.2008.07.003</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/c3ygtwuoqzgq7ameudtoomuuaq">fatcat:c3ygtwuoqzgq7ameudtoomuuaq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808233720/http://epge.fgv.br/finrio/myreview/FILES/CR2/p19.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/5a/77/5a777c6500d5269840d4b58e80284e763ee0918c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jbankfin.2008.07.003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

The Role of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Model

Caio Almeida, Jose Vicente
<span title="">2008</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tol7woxlqjeg5bmzadeg6qrg3e" style="color: black;">Social Science Research Network</a> </i> &nbsp;
We construct cross section (allowing arbitrages) and arbitrage-free versions of a parametric polynomial model to analyze how well they predict out-of-sample interest rates. Based on U.S.  ...  Furthermore, a decomposition of forecasts into forward-rates and holding return premia indicates that the superior performance of no-arbitrage versions is due to a better identification of bond risk premium  ...  This table presents bias (first number in each cell) and RMSE (second number in each cell) for 1-month, 6-month and 12-month ahead out-of-sample forecasts, for the three versions of the polynomial model  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2139/ssrn.3142987">doi:10.2139/ssrn.3142987</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2a6fos2qtncf5ikwif7yibuawu">fatcat:2a6fos2qtncf5ikwif7yibuawu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808233720/http://epge.fgv.br/finrio/myreview/FILES/CR2/p19.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/5a/77/5a777c6500d5269840d4b58e80284e763ee0918c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2139/ssrn.3142987"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ssrn.com </button> </a>

Complexity of DNA sequencing by hybridization

Jacek Błażewicz, Marta Kasprzak
<span title="">2003</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;
Subproblems of the general problem, depending on the type of error (positive, negative), are distinguished.  ...  Since decision versions of the subproblems assuming only one type of error are trivial, complexities of the search counterparts are studied.  ...  of this presentation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(02)00063-4">doi:10.1016/s0304-3975(02)00063-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xopmgjrmhzallmgip22b77ji44">fatcat:xopmgjrmhzallmgip22b77ji44</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170928022253/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/5cb/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzUwMjAwMDYzNA%3D%3D.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/5c/bc/5cbc730799b0e6d94bd60168c220fe8cdf47fa03.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(02)00063-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 407,492 results