View Item 

Show simple item record

Three Constraint Satisfaction Algorithms and Their Complexities: Search-Order Dependent and Effectively Instance-Specific Results
dc.contributor.authorNadel, Bernard A.
dc.date.accessioned2020-03-12T18:54:57Z
dc.date.available2020-03-12T18:54:57Z
dc.date.issued1986-01
dc.identifierCRL-TR-3-86
dc.identifier.urihttps://hdl.handle.net/2027.42/154154
dc.titleThree Constraint Satisfaction Algorithms and Their Complexities: Search-Order Dependent and Effectively Instance-Specific Results
dc.typeTechnical Report
dc.subject.hlbsecondlevelComputer Science
dc.subject.hlbtoplevelEngineering
dc.description.bitstreamurlhttps://deepblue.lib.umich.edu/bitstream/2027.42/154154/1/39015099114749.pdf
dc.owningcollnameEngineering, College of - Technical Reports


Files in this item

Name:
39015099114749.pdf
Size:
6.517MB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.