51

Computational complexity of some restricted instances of 3-SAT

Year:
2007
Language:
english
File:
PDF, 126 KB
english, 2007
52

New Approximation Algorithms for the Steiner Tree Problems

Year:
1997
Language:
english
File:
PDF, 2.05 MB
english, 1997
53

On a New High Dimensional Weisfeiler-Lehman Algorithm

Year:
1999
Language:
english
File:
PDF, 105 KB
english, 1999
57

Learning by the Process of Elimination

Year:
2002
Language:
english
File:
PDF, 129 KB
english, 2002
59

Subtree isomorphism is NC reducible to bipartite perfect matching

Year:
1989
Language:
english
File:
PDF, 843 KB
english, 1989
62

Approximating vertex cover in dense hypergraphs

Year:
2012
Language:
english
File:
PDF, 227 KB
english, 2012
68

Computing the Additive Complexity of Algebraic Circuits with Root Extracting

Year:
1998
Language:
english
File:
PDF, 287 KB
english, 1998
69

Computational Complexity of Sparse Rational Interpolation

Year:
1994
Language:
english
File:
PDF, 1.42 MB
english, 1994
70

Simulating Threshold Circuits by Majority Circuits

Year:
1998
Language:
english
File:
PDF, 318 KB
english, 1998
82

Inapproximability of dominating set on power law graphs

Year:
2015
Language:
english
File:
PDF, 654 KB
english, 2015