Foundations of Software Technology and Theoretical Computer Science: 11th Conference, New Delhi, India, December 17-19, 1991. Proceedings
Somenath Biswas, Kesav V. Nori
Springer Berlin Heidelberg, Nov 27, 1991 - Computers - 425 pages
This volume contains the proceedings of the Eleventh Conference on Foundations of Software Technology and Theoretical Computer Science held in New Dehli, India December 17-19, 1991. Three invited papers and 25 contributed papers selected from 78 submissions by authors from many different countries reflect the current research concerns of the theoreticalcomputer science community. The topics covered include: -Algorithms (sequential, parallel and geometric) -Automata theory -Functional programming -Learning -Logic of programs -Semantics -Structural complexity theory -Type theory.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Randomizing Reductions of Search Problems
H Karnick IIT Kanpur
13 other sections not shown
Other editions - View all
abstract accepting agent algorithm angle apply approach assume automaton bits bounded called cell changes circuits complexity Computer Computer Science consider constant construct contains contractable corresponding defined Definition denote described determined deterministic edges elements equation equivalence example exists expression fact failures Figure final finite formula function give given graph infinite initial input instance interpretation labelled language Lemma length logic minimal node normal Note notion obtained operational output packets pair parallel path points polynomial positive present problem processor projection proof Proposition prove random rank reasoning recursive reduction relation respectively result rules satisfies segment sequence shown simple solution solve sorting step structure subsets Suppose takes Theorem theory transition tree variables vertex vertices