Journals in DBLP

J. Comput. Syst. Sci.
1995, volume: 50, number: 3

1. Richard Chang, Jim Kadin, Pankaj Rohatgi
   On Unique Satisfiability and the Threshold Behavior of Randomized Reductions. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:50, n:3, pp:359-373 [Journal]
   
2. David A. Mix Barrington, Howard Straubing
   Superlinear Lower Bounds for Bounded-Width Branching Programs. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:50, n:3, pp:374-381 [Journal]
   
3. Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri
   Complexity Classes and Sparse Oracles. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:50, n:3, pp:382-390 [Journal]
   
4. Phokion G. Kolaitis, Madhukar N. Thakur
   Approximation Properties of NP Minimization Classes. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:50, n:3, pp:391-411 [Journal]
   
5. Sanjay Gupta
   Closure Properties and Witness Reduction. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:50, n:3, pp:412-432 [Journal]
   
6. Michelangelo Grigni, Michael Sipser
   Monotone Separation of Logarithmic Space from Logarithmic Depth. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:50, n:3, pp:433-437 [Journal]
   
7. Martin Beaudry, Pierre McKenzie
   Circuits, Matrices, and Nonassociative Computation. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:50, n:3, pp:441-455 [Journal]
   
8. Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán
   The Power of the Middle Bit of a #P Function. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:50, n:3, pp:456-467 [Journal]
   
9. Ricard Gavaldà
   Bounding the Complexity of Advice Functions. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:50, n:3, pp:468-475 [Journal]
   
10. Pankaj Rohatgi
    Saving Queries with Randomness. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:476-492 [Journal]
    
11. Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
    Descriptive Complexity of #P Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:493-505 [Journal]
    
12. Anne Condon, Richard E. Ladner
    Interactive Proof Systems with Polynomially Bounded Strategies. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:506-518 [Journal]
    
13. Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
    Learning Boolean Read-Once Formulas over Generalized Bases. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:521-542 [Journal]
    
14. Yishay Mansour
    An O(n^(log log n)) Learning Algorithm for DNT under the Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:543-550 [Journal]
    
15. David P. Helmbold, Manfred K. Warmuth
    On Weak Learning. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:551-573 [Journal]
    
16. Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai
    Breaking the Probability 1/2 Barrier in FIN-Type Learning. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:574-599 [Journal]
    
17. Michael Kharitonov
    Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:600-610 [Journal]