Difficult Configurations—On the Complexity of LTrL

ISSN： 0925-9856

Source： Formal Methods in System Design, Vol.26, Iss.1, 2005-01, pp. : 27-43

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

Abstract

Related content

A Class of Inverse Dominant Problems under Weighted l_∞ Norm and an Improved Complexity Bound for Radzik’s Algorithm

By Wang Qin Yang Xiaoguang Zhang Jianzhong

Journal of Global Optimization, Vol. 34, Iss. 4, 2006-04 ,pp. : 551-567

Springer Publishing Company

Access to resources Recommend Favorite

L-information systems and complete L-lattices

By Liu Hongping Li Qingguo Zhou Xiangnan

Neural Computing & Applications, Vol. 23, Iss. 3-4, 2013-09 ,pp. : 1139-1147

Springer Publishing Company

Access to resources Recommend Favorite

On the Exact Complexity of Evaluating Quantified k -CNF

By Calabro Chris Impagliazzo Russell Paturi Ramamohan

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 817-827

Springer Publishing Company

Access to resources Recommend Favorite

Computability and Complexity in Analysis (CCA). A View from Interval Computations - Cincinnati, Ohio, USA, August 28–30, 2003

By Brattka Vasco Kreinovich Vladik

Reliable Computing, Vol. 10, Iss. 1, 2004-02 ,pp. : 75-80

Springer Publishing Company

Access to resources Recommend Favorite

Robust polynomial classifier using L ¹-norm minimization

By Assaleh K. Shanableh T.

Applied Intelligence, Vol. 33, Iss. 3, 2010-12 ,pp. : 330-339

Springer Publishing Company

Access to resources Recommend Favorite