Period of time： 2007年3期
Publisher： Springer Publishing Company
Founded in： 1986
Total resources： 48
ISSN： 0178-4617
Subject： TP Automation Technology , Computer Technology
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Algorithmica,volume 48,issue 3
Menu
Quantum Complexity of Testing Group Commutativity
By Magniez Frederic,Nayak Ashwin in (2007)
Algorithmica,volume 48,issue 3 , Vol. 48, Iss. 3, 2007-07 , pp.
Access to resources
Recommend
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
By Dessmark Anders,Jansson Jesper,Lingas Andrzej,Lundell Eva-Marta in (2007)
Algorithmica,volume 48,issue 3 , Vol. 48, Iss. 3, 2007-07 , pp.Random 2-SAT with Prescribed Literal Degrees
By Cooper Colin,Frieze Alan,Sorkin Gregory B. in (2007)
Algorithmica,volume 48,issue 3 , Vol. 48, Iss. 3, 2007-07 , pp.A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem
Algorithmica,volume 48,issue 3 , Vol. 48, Iss. 3, 2007-07 , pp.The Consecutive Ones Submatrix Problem for Sparse Matrices
By Tan Jinsong,Zhang Louxin in (2007)
Algorithmica,volume 48,issue 3 , Vol. 48, Iss. 3, 2007-07 , pp.