Isolation, Matching, and Counting

Authors:
E. Allender;K. Reinhardt
Affiliations:
-;-
Venue:
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Year:
1998

Citing 0
Cited 2

NL-printable sets and nondeterministic Kolmogorov complexity

Theoretical Computer Science - Logic, language, information and computation
A combinatorial algorithm for Pfaffians

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract