472 results on '"Book, Ronald V."'
Search Results
2. Length as the Basis for Reduction
3. Length-Reducing Non-Monadic String-Rewriting Systems
4. Monadic String-Rewriting Systems
5. Preliminaries
6. String-Rewriting Systems
7. Introduction
8. On type-2 probabilistic quantifiers
9. On random hard sets for NP
10. The global power of additional queries to random oracles
11. Relativizing complexity classes with Random Oracles
12. On Sets with Small Information Content
13. Relativizations of the P=? NP and other problems: Some developments in structural complexity theory
14. On complexity classes and algorithmically random languages : Extended abstract
15. A note on confluent Thue systems
16. Additional queries to random and pseudorandom oracles
17. Descriptional Complexity (Dagstuhl Seminar 9318)
18. An observation on probability versus randomness with applications to complexity classes
19. Relativizations of the P = ?NP and other problems: developments in structural complexity theory
20. Characterizing polynomial complexity classes by reducibilities
21. On type-2 probabilistic quantifiers
22. On random hard sets for NP
23. A View of Structural Complexity Theory
24. String-Rewriting Systems
25. Relativizing complexity classes with Random Oracles
26. Relativizations of the P=? NP and other problems: Some developments in structural complexity theory
27. On complexity classes and algorithmically random languages
28. A note on confluent Thue systems
29. Dehn's Algorithm and the Complexity of Word Problems.
30. On The Structure of Complexity Classes
31. Towards a theory of relativizations: Positive relativizations
32. Sparse sets, tally sets, and polynomial reducibilities
33. Immunity : Extended abstract
34. The Verifiability of Two-Party Protocols
35. On generalized kolmogorov complexity
36. Thue systems as rewriting systems
37. Controlled relativizations of P and NP : Abstract
38. Separating polynomial-time turing and truth-table reductions by tally sets
39. The power of the Church-Rosser property for string rewriting systems
40. Sparse oracles, lowness, and highness
41. Formal language theory and theoretical computer science
42. On the computational power of reversal-bounded machines
43. Comparisons and reset machines : Preliminary report
44. Representing complexity classes by equality sets : Preliminary report
45. Complexity classes of formal languages : Preliminary report
46. The polynomial-time hierarchy and sparse oracles.
47. The existence and density of generalized complexity cores.
48. Refining Nondeterminism in Relativizations of Complexity Classes.
49. Confluent and Other Types of Thue Systems.
50. Simple Representations of Certain Classes of Languages.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.