Results 31 to 40 of about 94,123 (313)
The Problem of Finding the Maximal Multiple Flow in the Divisible Network and its Special Cases
Моделирование и анализ информационных систем, 2015 In the article the problem of finding the maximal multiple flow in the network of any natural multiplicity k is studied. There are arcs of three types: ordinary arcs, multiple arcs and multi-arcs.
A. V. Smirnov
doaj +1 more source
Query learning of derived $\omega$-tree languages in polynomial time [PDF]
Logical Methods in Computer Science, 2019 We present the first polynomial time algorithm to learn nontrivial classes of languages of infinite trees. Specifically, our algorithm uses membership and equivalence queries to learn classes of $\omega$-tree languages derived from weak regular $\omega ...
Dana Angluin +2 more
doaj +1 more source
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
Interpolation by lattice polynomial functions: A polynomial time algorithm [PDF]
Fuzzy Sets and Systems, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quentin Brabant +2 more
openaire +2 more sources
Practical polynomial factoring in polynomial time [PDF]
, 2010 State of the art factoring in Q[x] is dominated in theory by a combinatorial reconstruction problem while, excluding some rare polynomials, performance tends to be dominated by Hensel lifting.
Andrew Novocin +7 more
core +1 more source
A polynomial algorithm for packing unit squares in a hypograph of a piecewise linear function
Open Engineering, 2017 We consider the problem of packing the maximal number of unit squares in a hypograph of a function. A polynomial time algorithm is described to solve this problem for a piecewise linear function.
Arslanov Marat +2 more
doaj +1 more source
On the exact polynomial time algorithm for a special class of bimatrix game
Lietuvos Matematikos Rinkinys, 2013 The Strategy Elimination (SE) algorithm was proposed in [2] and implemented by a sequence of Linear Programming (LP) problems. In this paper an efficient explicit solution is developed and the convergence to the Nash Equilibrium is proven. Keywords: game
Jonas Mockus, Martynas Sabaliauskas
doaj +1 more source
On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry [PDF]
Logical Methods in Computer Science, 2015 An algorithm for unification modulo one-sided distributivity is an early result by Tid\'en and Arnborg. More recently this theory has been of interest in cryptographic protocol analysis due to the fact that many cryptographic operators satisfy this ...
Andrew M Marshall +2 more
doaj +1 more source
Quantum algorithms for the Jones polynomial [PDF]
SPIE Proceedings, 2010 This paper gives a generalization of the AJL algorithm and unitary braid group representation for quantum computation of the Jones polynomial to continuous ranges of values on the unit circle of the Jones parameter. We show that our 3-strand algorithm for the Jones polynomial is a special case of this generalization of the AJL algorithm.
Kauffman, Louis H. +1 more
openaire +2 more sources
Fast library for number theory : an introduction [PDF]
, 2010 We discuss FLINT (Fast Library for Number Theory), a library to support computations in number theory, including highly optimised routines for polynomial arithmetic and linear algebra in exact ...
R. A. Carr +4 more
core +1 more source