Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             15 results found
no title author magazine year volume issue page(s) type
1 EDITOR'S FOREWORD Homer, Steven
1996
53 2 p. 153-
1 p.
article
2 EDITOR'S FOREWORD Schöning, Uwe
1996
53 2 p. 233-
1 p.
article
3 Logical Definability of Counting Functions Compton, Kevin J.
1996
53 2 p. 283-297
15 p.
article
4 Multi-prover Encoding Schemes and Three-prover Proof Systems Tardos, Gábor
1996
53 2 p. 251-260
10 p.
article
5 On Closure Properties of #P in the Context of PF∘#P Ogihara, Mitsunori
1996
53 2 p. 171-179
9 p.
article
6 On Limited Nondeterminism and the Complexity of the V-C Dimension Papadimitriou, Christos H.
1996
53 2 p. 161-170
10 p.
article
7 On the Isomorphism Conjecture for Weak Reducibilities Agrawal, Manindra
1996
53 2 p. 267-282
16 p.
article
8 On the Query Complexity of Clique Size and Maximum Satisfiability Chang, Richard
1996
53 2 p. 298-313
16 p.
article
9 Pointers versus Arithmetic in PRAMs Dymond, Patrick W.
1996
53 2 p. 218-232
15 p.
article
10 Polynomial-Time Isomorphism of 1-L-Complete Sets Agrawal, Manindra
1996
53 2 p. 155-160
6 p.
article
11 P-Selective Self-Reducible Sets: A New Characterization of P Buhrman, Harry
1996
53 2 p. 210-217
8 p.
article
12 P-Selective Sets and Reducing Search to Decision vs Self-Reducibility Hemaspaandra, Edith
1996
53 2 p. 194-209
16 p.
article
13 Random Strings Make Hard Instances Buhrman, Harry
1996
53 2 p. 261-266
6 p.
article
14 Relative to a Random Oracle, NP Is Not Small Kautz, Steven M.
1996
53 2 p. 235-250
16 p.
article
15 Taking It to the Limit: On Infinite Variants of NP-Complete Problems Hirst, Tirza
1996
53 2 p. 180-193
14 p.
article
                             15 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands