SIGN IN
SIGN UP
Operations on sparse relations
Full Text:
PDF
Buy this Article
Authors:
H. B. Hunt, III
Harvard Univ., Cambridge, MA
J. D. Ullman
Princeton Univ., Princeton, NJ
T. G. Szymanski
Published in:
· Magazine
Communications of the ACM
CACM Homepage
archive
Volume 20 Issue 3, March 1977
Pages 171-176
ACM
New York, NY
, USA
table of contents
doi>
10.1145/359436.359446
1977 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 3
· Downloads (cumulative): 220
· Citation Count: 6
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
boolean matrix
computational complexity
directed graph
linear precedence function
slr grammar
sparse relation
t-canomical precedence relation
wirth-weber precedence relation
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder