Author： Fedin S. Kulikov A.
Publisher： Springer Publishing Company
ISSN： 1072-3374
Source： Journal of Mathematical Sciences, Vol.134, Iss.5, 2006-05, pp. : 2383-2391
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
Propositional lower bounds: Algorithms and complexity
By Cadoli M.
Annals of Mathematics and Artificial Intelligence, Vol. 27, Iss. 1-4, 1999-01 ,pp. :
Upper Bounds on the Rate of Quantum Ergodicity
Annales Henri Poincaré, Vol. 7, Iss. 6, 2006-10 ,pp. :
Upper bounds in the theory of unknotting operations
By Lackenby M.
Topology, Vol. 37, Iss. 1, 1998-01 ,pp. :
New Upper Bounds for Maximum Satisfiability
By Niedermeier R. Rossmanith P.
Journal of Algorithms, Vol. 36, Iss. 1, 2000-07 ,pp. :