SIGN IN
SIGN UP
Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures
Full Text:
Pdf
Buy this Article
Authors:
Harry B. Hunt, III
Univ. at Albany-State Univ. of New York, Albany
Madhav V. Marathe
Univ. at Albany-State Univ. of New York, Albany
Richard E. Stearns
Univ. at Albany-State Univ. of New York, Albany
Published in:
· Proceeding
ISSAC '01
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Pages 183 - 191
ACM
New York, NY
, USA
©2001
table of contents
ISBN:1-58113-417-7
doi>
10.1145/384101.384126
2001 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 6
· Downloads (cumulative): 198
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
ISSAC'13
Share:
|
Tags:
algorithms
complexity of proof procedures
general
representations
verification
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