11 citations · 18 across the 6 of their papers we have counts for
Showing 2003Show all
2 papers · 1 filter
cs.CC2003
Complexity of Cycle Length Modularity Problems in Graphs
Edith Hemaspaandra, Holger Spakowski, Mayur Thakur
The even cycle problem for both undirected and directed graphs has been the topic of intense research in the last decade. In this paper, we study the computational complexity of \e…
cs.CC2003
The Complexity of Boolean Constraint Isomorphism
Elmar Böhler, Edith Hemaspaandra, Steffen Reith +1
In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems (nowadays usua…