Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

86

Voted

STACS
2010
Springer

149views Theoretical Computer Science» more STACS 2010»

Holant Problems for Regular Graphs with Complex Edge Functions

15 years 10 months ago

Holant Problems for Regular Graphs with Complex Edge Functions

Download hal.inria.fr

Michael Kowalczyk, Jin-yi Cai

Real-time Traffic

STACS 2010 | Theoretical Computer Science |

claim paper

Related Content

» Edge Weight Regularization over Multiple Graphs for Similarity Learning

» Adding regular expressions to graph reachability and pattern queries

» L2 norm regularized feature kernel regression for graph data

» A minimum spanning tree algorithm with InverseAckermann type complexity

» Optimal query complexity bounds for finding graphs

» Labeled Traveling Salesman Problems Complexity and approximation

» Transfer Learning with Graph CoRegularization

» Ranking on graph data

» Testing subgraphs in directed graphs

Post Info
More Details (n/a)

Added	14 May 2010
Updated	14 May 2010
Type	Conference
Year	2010
Where	STACS
Authors	Michael Kowalczyk, Jin-yi Cai

Comments (0)