1.4k citations
- Florida International UniversityUS12 papers
- Hampton UniversityUS12 papers
- Kent State UniversityUS12 papers
- Massachusetts Institute of TechnologyUS12 papers
- Norfolk State UniversityUS12 papers
- Old Dominion UniversityUS12 papers
- Thomas Jefferson National Accelerator FacilityUS12 papers
- University of VirginiaUS12 papers
- William & MaryUS12 papers
- A. Alikhanyan National LaboratoryAM11 papers
- Jožef Stefan InstituteSI11 papers
- Ohio UniversityUS11 papers
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2011
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy
Jin-Yi Cai, Michael Kowalczyk, Tyson Williams
We introduce an idea called anti-gadgets in complexity reductions. These combinatorial gadgets have the effect of erasing the presence of some other graph fragment, as if we had ma…
cs.CC2010★ 16 cited
Holant Problems for Regular Graphs with Complex Edge Functions
Michael Kowalczyk, Jin-Yi Cai
We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dime…