The method of forced enumeration for nondeterministic automata
Acta Informatica
Using inductive counting to simulate nondeterministic computation
Information and Computation
Isolation, matching and counting uniform and nonuniform upper bounds
Journal of Computer and System Sciences
Nondeterministic Logspace Reductions
Proceedings of the Mathematical Foundations of Computer Science 1984
An Unambiguous Class Possessing a Complete Set
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Unambiguity and Fewness for Logarithmic Space
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Making nondeterminism unambiguous
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Space-bounded hierarchies and probabilistic computations
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On non-erasing oracle tapes in space bounded reducibility
ACM SIGACT News
Hierarchies of memory limited computations
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
| Hi-index | 0.00 |
We investigate different variants of unambiguity in the context of computing multi-valued functions. We propose a modification to the standard computation models of Turing machines and configuration graphs, which allows for unambiguity-preserving composition. We define a notion of reductions (based on function composition), which allows nondeterminism but controls its level of ambiguity. In light of this framework we establish reductions between different variants of path counting problems. We obtain improvements of results related to inductive counting.