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
[1]
Hilfe
Suche: Author="Huang, Sangxia"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation resistance on satisfiable instances for predicates with few accepting inputs
Sangxia Huang
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 457-466
From Holant to \#CSP and back: Dichotomy for Holant
^c
problems
Jin-Yi Cai
,
Sangxia Huang
,
Pinyan Lu
Algorithmica
64
(3), 2012, pp. 511-533
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
From Holant to \#CSP and back: Dichotomy for Holant
^c
problems
Jin-Yi Cai
,
Sangxia Huang
,
Pinyan Lu
Lecture Notes in Computer Science
6506
, 2010, pp. 253-265