Period of time： 2014年5期
Publisher： Springer Publishing Company
Founded in： 1966
Total resources： 31
ISSN： 1432-4350
Subject： O1 Mathematics
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Theory of Computing Systems,volume 39,issue 5
Menu
Energy-Efficient Wireless Network Design
By Caragiannis Ioannis in (2006)
Theory of Computing Systems,volume 39,issue 5 , Vol. 39, Iss. 5, 2006-09 , pp.
Access to resources
Recommend
Useful Templates and Iterated Template-Guided DNA Recombination in Ciliates
Theory of Computing Systems,volume 39,issue 5 , Vol. 39, Iss. 5, 2006-09 , pp.Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
Theory of Computing Systems,volume 39,issue 5 , Vol. 39, Iss. 5, 2006-09 , pp.The Complexity of Finding Top-Toda-Equivalence-Class Members
By Hemaspaandra Lane A. in (2006)
Theory of Computing Systems,volume 39,issue 5 , Vol. 39, Iss. 5, 2006-09 , pp.Selection Functions that Do Not Preserve Normality
Theory of Computing Systems,volume 39,issue 5 , Vol. 39, Iss. 5, 2006-09 , pp.A Note on MOD p - MOD m Circuits
Theory of Computing Systems,volume 39,issue 5 , Vol. 39, Iss. 5, 2006-09 , pp.Some Results on Effective Randomness
Theory of Computing Systems,volume 39,issue 5 , Vol. 39, Iss. 5, 2006-09 , pp.Generating Instances for MAX2SAT with Optimal Solutions
Theory of Computing Systems,volume 39,issue 5 , Vol. 39, Iss. 5, 2006-09 , pp.A Special Case of a Unary Regular Language Containment
Theory of Computing Systems,volume 39,issue 5 , Vol. 39, Iss. 5, 2006-09 , pp.An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes
Theory of Computing Systems,volume 39,issue 5 , Vol. 39, Iss. 5, 2006-09 , pp.