Combining methods from graph theory and linear algebra, we study SAT problems of low ``linear algebra complexity'', considering the class of formulas with bounded hermitian rank. We show polynomial time SAT decision of the class of formulas with hermitian rank at most one by applying methods from hypergraph transversal theory. Several directions for extensions are discussed.