6,576 Hits in 2.4 sec

Improving the complexity of Parys' recursive algorithm [article]

Karoliina Lehtinen, Sven Schewe, Dominik Wojtczak
2019 arXiv   pre-print
In this brief note we suggest a variation of his algorithm that improves the complexity to meet the state-of-the-art complexity of broadly 2^O((log n)(log c)), while providing polynomial bounds when the  ...  Parys has recently proposed a quasi-polynomial version of Zielonka's recursive algorithm for solving parity games.  ...  Acknowledgements We thank Pawe l Parys for his comments.  ... 
arXiv:1904.11810v4 fatcat:i5kirvioyjh2bjrug63khjsoma

Page 948 of Mathematical Reviews Vol. 20, Issue 9 [page]

1959 Mathematical Reviews  
(ii) If every recursive set is definable in 7, T consistent, then the sets of true and false sentences of TJ are recursively inseparable. (i) re- presents an improvement upon a result of Myhill [Z.  ...  The algorithm is ‘‘applicable”’ to a given state if, beginning with this state, a finite sequence of transformations leads to a terminal state; from the terminal state, a certain sub-complex called the  ... 

Page 6346 of Mathematical Reviews Vol. , Issue 2002I [page]

2002 Mathematical Reviews  
Now, there are many algorithms for computing f: the claim is that the ‘essential, implementation-independent properties’ of each of them are captured by a recursive definition, while some ‘algorithms which  ...  2002i:03051 apply results about them; to promote the problem of defining al- gorithms correctly; and to describe briefly a plausible solution, by which algorithms are recursive definitions while machines  ... 

A Universal Attractor Decomposition Algorithm for Parity Games [article]

Marcin Jurdziński, Rémi Morvan
2020 arXiv   pre-print
A symbolic implementation of the universal algorithm is also given that improves the symbolic space complexity of solving parity games in quasi-polynomial time from O(d n)—achieved by Chatterjee, Dvořák  ...  An attractor decomposition meta-algorithm for solving parity games is given that generalizes the classic McNaughton-Zielonka algorithm and its recent quasi-polynomial variants due to Parys (2019), and  ...  The idea of the design of the universal algorithm has been discovered independently and later by Nathanaël Fijalkow; we thank him for sharing his conjectures with us and exchanging ideas about adaptive  ... 
arXiv:2001.04333v1 fatcat:oymtgqhjmvbmbpualadyag75r4

Efficient parameter inference in general hidden Markov models using the filter derivatives [article]

Jimmy Olsson, Johan Westerborn
2016 arXiv   pre-print
In this paper we present an online parameter estimation algorithm obtained by casting our recently proposed particle-based, rapid incremental smoother (PaRIS) into the framework of recursive maximum likelihood  ...  By using the computational efficient and numerically stable PaRIS algorithm for estimating the needed prediction filter derivatives we obtain a fast algorithm with a computational complexity that grows  ...  The performance of the algorithm is illustrated by simulations indicating clearly improved convergence properties of the parameter estimates.  ... 
arXiv:1601.05568v2 fatcat:rvezwi6pdjfgjcpnl5shvijsam

Sparse polynomial multiplication and division in Maple 14

Michael Monagan, Roman Pearce
2011 ACM SIGSAM Bulletin  
our improvements to polynomial multiplication and division.  ...  We then present some benchmarks comparing our software with the Magma, Maple, Singular, Trip and Pari computer algebra systems and also illustrating how multivariate polynomial factorization benefits from  ...  Computer algebra systems that use the recursive representation by default include Maxima, Derive, Reduce, Pari, and Trip.  ... 
doi:10.1145/1940475.1940521 fatcat:bt23cmldczds7kvsgqhvjxn6jm

Page 257 of Mathematical Reviews Vol. , Issue 85a [page]

1985 Mathematical Reviews  
(English summary) [Complexity of parallel QR factorization] C. R. Acad. Sci. Paris Sér. I Math. 297 (1983), no. 2, 137-139.  ...  All the algorithms require O(nlogn) space, and for all of them the factor log?n can be improved to log n log log n, at the cost of some complication of the basic data structure used.”  ... 

Higher-Order Model Checking: From Theory to Practice

Naoki Kobayashi
2011 2011 IEEE 26th Annual Symposium on Logic in Computer Science  
The model checking of higher-order recursion schemes (higher-order model checking for short) has been actively studied in the last decade, and has seen significant progress in both theory and practice.  ...  This short article aims to provide an overview of the recent progress in higher-order model checking and discuss future directions.  ...  Although the worstcase time complexity of the algorithms is not polynomial in the size of recursion schemes (recall Section IV-A3), the algorithms run fast for many realistic inputs according to experiments  ... 
doi:10.1109/lics.2011.15 dblp:conf/lics/Kobayashi11 fatcat:uc23ml5ekbc23ojg3herppprdq

Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries [chapter]

Mickaël Gastineau, Jacques Laskar
2006 Lecture Notes in Computer Science  
Flat vector representation of sparse multivariate polynomials is introduced in the computer algebra system TRIP with specific care to the cache memory.  ...  Timing and memory consumption are examined and compared with other recursive representations and other computer algebra systems.  ...  When polynomials are stored in the recursive list or vector, a simple naive recursive algorithm is performed.  ... 
doi:10.1007/11758525_60 fatcat:fv2zfukcknfpjpfpvyqoignouu

New multichannel modified filtered‐x algorithms for active noise control using the dichotomous coordinate descent method

Felix Albu, Constantin Paleologu
2008 Journal of the Acoustical Society of America  
This multiplier-less and division-less method is used for avoiding the matrix inversion that appears in adaptive algorithms such us recursive least square (RLS) based algorithms, affine projection (AP)  ...  The study is focused on the important computational savings given by the use of DCD method, the effect on the convergence properties and stability of the investigated algorithms.  ...  The numerical complexities of the considered algorithms isTable 1.  ... 
doi:10.1121/1.2935769 fatcat:t4vgkxhbzjhexahhcpzendpny4

Page 3557 of Mathematical Reviews Vol. , Issue 83i [page]

1983 Mathematical Reviews  
Basic concepts described in this paper are: algorithm, unbounded register machine (URM), abstract complexity measure, time, space, worst-case complexity, average-case complexity, simulation, basic machine  ...  models: RAM, storage modification machines, Turing machines, URM, polynomial time and real time equivalence of machine types, algorithms and recursive functions, recursive and recursively enumerable sets  ... 

Page 2577 of Mathematical Reviews Vol. , Issue 97D [page]

1997 Mathematical Reviews  
We apply these observations as a heuristic to improve the performance of genetic algorithms for some constraint satisfaction problems.  ...  As a spe- cific test case, we used the GENESIS genetic algorithm to search for the optimum of a class of random Walsh polynomials and identified the improvement due to this new heuristic.  ... 

Page 4523 of Mathematical Reviews Vol. , Issue 97G [page]

1997 Mathematical Reviews  
We present the algorithm MORO to establish this fact.” 97g:68205 68125 68T27 Levy, Alon Y.; Rousset, Marie-Christine (F-PARIS!  ...  The complexity of the following algorithmic prob- lems is evaluated (i) determining whether an explanation exists, (ii) determining whether a hypothesis A € H is a part of some ex- planation (relevant)  ... 

Page 2728 of Mathematical Reviews Vol. , Issue 98D [page]

1998 Mathematical Reviews  
The complexity of recursive computation of MPUM and the exten- sion to finite time-series are investigated.  ...  variant of the Dijkstra algorithm.  ... 

Page 3755 of Mathematical Reviews Vol. , Issue 2002E [page]

2002 Mathematical Reviews  
Moreover, we propose an improved broadcast- ing cryptosystem, which is a slight modification of the proposed system to overcome the conspiracy attack.” 2002¢:94103 94A60 Vaudenay, Serge (F-ENS; Paris)  ...  at the evaluation of the cryptographic algorithms.  ... 
« Previous Showing results 1 — 15 out of 6,576 results