Inductive Time-Space Lower Bounds for Sat and Related Problems

ISSN： 1016-3328

Source： computational complexity, Vol.15, Iss.4, 2006-12, pp. : 433-470

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Lower Bounds for Dynamic Algebraic Problems

By Frandsen G.S. Hansen J.P. Miltersen P.B.

Information and Computation, Vol. 171, Iss. 2, 2001-12 ,pp. : 333-349

Academic Press

Access to resources Recommend Favorite

Time‐space PGD for the rapid solution of 3D nonlinear parametrized problems in the many‐query context

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Vol. 103, Iss. 4, 2015-07 ,pp. : 275-292

John Wiley & Sons Inc

Access to resources Recommend Favorite

Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems

By Kullmann Oliver

Annals of Mathematics and Artificial Intelligence, Vol. 40, Iss. 3-4, 2004-03 ,pp. : 303-352

Springer Publishing Company

Access to resources Recommend Favorite

A computational analysis of lower bounds for big bucket production planning problems

By Akartunalı Kerem

Computational Optimization and Applications, Vol. 53, Iss. 3, 2012-12 ,pp. : 729-753

Springer Publishing Company

Access to resources Recommend Favorite

Lower bounds on entropy via the Conley index with application to time series

By Baker A.W.

Topology and its Applications, Vol. 120, Iss. 3, 2002-05 ,pp. : 333-354

Elsevier

Access to resources Recommend Favorite