Period of time: 2014年2期
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 41,issue 2
Menu
On the Incompressibility of Monotone DNFs
By Krieger Matthias P. in (2007)
Theory of Computing Systems,volume 41,issue 2 , Vol. 41, Iss. 2, 2007-08 , pp.Leftist Grammars and the Chomsky Hierarchy
By Jurdzinski Tomasz in (2007)
Theory of Computing Systems,volume 41,issue 2 , Vol. 41, Iss. 2, 2007-08 , pp.On the Power of Unambiguity in Alternating Machines
Theory of Computing Systems,volume 41,issue 2 , Vol. 41, Iss. 2, 2007-08 , pp.Logspace Optimization Problems and Their Approximability Properties
Theory of Computing Systems,volume 41,issue 2 , Vol. 41, Iss. 2, 2007-08 , pp.Average-Case Non-Approximability of Optimisation Problems
Theory of Computing Systems,volume 41,issue 2 , Vol. 41, Iss. 2, 2007-08 , pp.A Simple and Fast Min-Cut Algorithm
By Brinkmeier Michael in (2007)
Theory of Computing Systems,volume 41,issue 2 , Vol. 41, Iss. 2, 2007-08 , pp.Exact Algorithms for Graph Homomorphisms
Theory of Computing Systems,volume 41,issue 2 , Vol. 41, Iss. 2, 2007-08 , pp.