Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Guo, Heng"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Holographic algorithms beyond matchgates
Jin-Yi Cai
,
Heng Guo
,
Tyson Williams
Lecture Notes in Computer Science
8572
, 2014, pp. 271-282
A complete dichotomy rises from the capture of vanishing signatures
Jin-Yi Cai
,
Heng Guo
,
Tyson Williams
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 635-644
The complexity of symmetric Boolean parity Holant problems
Heng Guo
,
Pinyan Lu
,
Lelie G. Valiant
SIAM Journal on Computing
42
(1), 2013, pp. 324-356
The complexity of planar Boolean \#CSP with complex weights
Heng Guo
,
Tyson Williams
Lecture Notes in Computer Science
7965
, 2013, pp. 516-527
The complexity of weighted Boolean \#CSP modulo
k
Heng Guo
,
Sangxia Huang
,
Pinyan Lu
,
Mingji Xia
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 249-260
The complexity of symmetric Boolean parity Holant problems
Heng Guo
,
Pinyan Lu
,
Leslie G. Valiant
Lecture Notes in Computer Science
6755
, 2011, pp. 712-723