174 results on '"Pnueli, A."'
Search Results
2. Computable Quantifiers and Logics over Finite Structures
3. Oracles and quantifiers
4. Refining the Undecidability Frontier of Hybrid Automata
5. Computable Quantifiers and Logics over Finite Structures
6. Bounded reductions
7. Functional oracle queries as a measure of parallel time
8. Nondeterminism within P
9. Interactive proof systems and alternating time-space complexity
10. Randomized polynomials, threshold circuits, and the polynomial hierarchy
11. The owner concept for PRAMs
12. Linear bounded automata and rewrite systems : Influence of initial configurations on decision properties
13. Counting the number of solutions : A survey of recent inclusion results in the area of counting classes
14. One-way functions in complexity theory
15. Type inference problems: A survey
16. Restricted branching programs and their computational power
17. Separating ⊕L from L, NL, co-NL and AL (=P) for Oblivious turing machines of linear access time
18. Minimal nontrivial space complexity of probabilistic one- way turing machines
19. Speed-up theorem without tape compression
20. Using inductive counting to simulate nondeterministic computation
21. Oracles versus proof techniques that do not relativize
22. Structural complexity theory: Recent surprises
23. Additional queries to random and pseudorandom oracles
24. A formal study of learning via queries
25. Normalizing and accelerating RAM computations and the problem of reasonable space measures
26. Nondeterministic computations in sublogarithmic space and space constructibility
27. Ω-branching programs of bounded width
28. On the power of bounded concurrency II: The pushdown automata level
29. The complexity of graph problems for succinctly represented graphs
30. A note on the almost-everywhere hierarchy for nondeterministic time
31. Counting classes: Thresholds, parity, mods, and fewness
32. Efficient checking of computations
33. Combinatorial rewriting on traces
34. On the Complexity of Pseudo-Random Sequences - or: If You Can Describe a Sequence It Can’t be Random
35. Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility
36. On the formal aspects of approximation algorithms
37. Some remarks on polynomial time isomorphisms
38. Hardware algorithms for VLSI systems
39. Connections with language theory
40. Some properties of space-bounded synchronized alternating turing machines with only universal states
41. A survey of two-dimensional automata theory
42. Questions of decidability for context-free chain code picture languages
43. Complexity theory and formal languages
44. Domino games with an application to the complexity of boolean algebras with bounded quantifier alternations
45. How to Solve any Protocol Problem - An Efficiency Improvement (Extended Abstract)
46. Direct Minimum-Knowledge Computations (Extended Abstract)
47. The computational complexity of cellular automata
48. Representation of recursively enumerable languages using alternating finite tree recognizers
49. Extensional properties of sets of time bounded complexity (extended abstract)
50. Complexity classes with complete problems between P and NP-C
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.