Axiomatically analyzing complexity behaviour of tree searching algorithms and characterization of fuzzy tree searches

dc.contributor.guide	D, Khamitkar S
dc.coverage.spatial	Computer Science
dc.creator.researcher	Bhalchandra, Parag Upendra
dc.date.accessioned	2018-09-12T10:32:51Z
dc.date.available	2018-09-12T10:32:51Z
dc.date.awarded	n.d.
dc.date.completed	2014
dc.date.registered	n.d.
dc.description.abstract	Abstract not available
dc.description.note	Data not available
dc.format.accompanyingmaterial	None
dc.format.dimensions	30cm.
dc.format.extent	xx, 221p.
dc.identifier.uri	http://hdl.handle.net/10603/214985
dc.language	English
dc.publisher.institution	Department of Computer Science
dc.publisher.place	Nanded
dc.publisher.university	Swami Ramanand Teerth Marathwada University
dc.relation	213-220
dc.rights	university
dc.source.university	University
dc.subject.keyword	Axiomatic
dc.subject.keyword	Brute-force
dc.subject.keyword	Constraint
dc.subject.keyword	Hanoi
dc.subject.keyword	Heuristic
dc.title	Axiomatically analyzing complexity behaviour of tree searching algorithms and characterization of fuzzy tree searches
dc.title.alternative
dc.type.degree	Ph.D.