Results 21 to 30 of about 1,907,337 (239)
On the complexity of integer polynomial recursive sequences
Известия высших учебных заведений. Поволжский регион: Физико-математические науки, 2022 Background. Linear recursive sequences represent the “classic'” object of combinatorial analysis. To express an arbitrary term of a linear recursive sequence, there are exact formulas of exponential type as in the case of a field of complex numbers ...
S.S. Marchenkov
doaj +1 more source
Research on Linear Complexity of Quaternary Sequences with Period 2pq [PDF]
Jisuanji gongcheng, 2016 Linear complexity is an important index for measuring the randomness properties of the sequences.Based on the theory of generalized cyclotomic,a new class of quaternary balanced generalized cyclotomic sequences with period 2pq over finite field F4 is ...
WEI Wanyin,DU Xiaoni,WANG Guohui
doaj +1 more source
A Complexity Approach to Tree Algebras: the Polynomial Case [PDF]
, 2022 In this paper, we consider infinitely sorted tree algebras recognising regular language of finite trees. We pursue their analysis under the angle of their asymptotic complexity, i.e.
Jaquard, Arthur, Colcombet, Thomas
core +1 more source
Implicit complexity through linear realisability: polynomial time and probabilistic classes
, 2023 Based on work on realisability models for linear logic, the author recently proposed a new approach of implicit computational complexity. He showed how to characterise in this way a hierarchy of sub-linear space non-deterministic complexity classes by ...
Seiller, Thomas
core +2 more sources
Square-rich fixed point polynomial evaluation on FPGAs [PDF]
, 2014 Polynomial evaluation is important across a wide range of application domains, so significant work has been done on accelerating its computation. The conventional algorithm, referred to as Horner's rule, involves the least number of steps but can lead to
McLoughlin, Ian V. +5 more
core +1 more source
Symmetries in Polynomial Optimization [PDF]
, 2023 This chapter investigates how symmetries can be used to reduce the computational complexity in polynomial optimization problems. A focus will be specifically given on the Moment-SOS hierarchy in polynomial optimization, where results from representation ...
Verdure, Hugues +2 more
core +1 more source
Lower Bound of the Complexity of Seven-Valued Functions in the Class of Polarized Polynomials
Известия Иркутского государственного университета: Серия "Математика", 2017 One of the directions of the investigation of functions over finite fields is the study of their representations, including polynomial ones. In the area of polynomial representations of functions the problem of estimating the complexity of such ...
A.S. Baliuk, A.S. Zinchenko
doaj +1 more source
Logical Methods in Computer Science, 2013 This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP*, that is applicable in two ...
Martin Avanzini, Georg Moser
doaj +1 more source
A Finite-Model-Theoretic View on Propositional Proof Complexity [PDF]
Logical Methods in Computer Science, 2022 We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the ...
Erich Grädel +3 more
doaj +1 more source
Uncurrying for Innermost Termination and Derivational Complexity [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we investigate how this
Aart Middeldorp +2 more
doaj +1 more source