%0 Generic
%T Lecture Notes in Computer Science: The complexity of the falsifiability problem for pure implicational formulas
%A Heusch, Peter
%I Springer Berlin Heidelberg
%@ 0302-9743
%@ 1611-3349
%D 1995
%C Springer Berlin Heidelberg
%U http://slubdd.de/katalog?TN_libero_mab2
Download citation