ARTÍCULO
TITULO

A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function

P. G. Walsh    

Resumen

No disponible

 Artículos similares

       
 
Yingjie Tang, Junmin Mou, Linying Chen and Yang Zhou    
Through the continuous development of intellectualization, considering the lifecycle of ships, the future of a waterborne traffic system is bound to be a mixed scenario where intelligent ships of different autonomy levels co-exist, i.e., mixed waterborne... ver más

 
Zepeng Hu, Qi Wu, Jifeng Zou and Qun Wan    
This paper addresses the two-dimensional (2D) direction-of-arrival (DOA) estimation issue for signals with known waveforms but unknown amplitudes using uniform circular array (UCA). Unlike maximum likelihood (ML) methods such as decoupled maximum likelih... ver más
Revista: Applied Sciences

 
Spyros Sioutas, Efrosini Sourla, Kostas Tsichlas, Gerasimos Vonitsanos and Christos Zaroliagis    
In this work, we propose ??3 D 3 -Tree, a dynamic distributed deterministic structure for data management in decentralized networks, by engineering and extending an existing decentralized structure. Conducting an extensive experimental study, we verify t... ver más
Revista: Algorithms

 
Yaru Li, Yulai Zhang and Yongping Cai    
The selection of the hyper-parameters plays a critical role in the task of prediction based on the recurrent neural networks (RNN). Traditionally, the hyper-parameters of the machine learning models are selected by simulations as well as human experience... ver más
Revista: Algorithms

 
Vladimir Gurvich and Mikhail Vyalyi    
We study the algorithmic complexity of solving subtraction games in a fixed dimension with a finite difference set. We prove that there exists a game in this class such that solving the game is EXP-complete and requires time 2O(??) 2 O ( n ) , where n is... ver más
Revista: Algorithms