-
2
-
-
85044551501
-
Reconstructing algebraic functions from mixed data
-
S. Ar, R. Lipton, R. Rubinfeld, and M. Sudan, Reconstructing algebraic functions from mixed data, in Proc. 33rd Annual IEEE Symposium on foundations of Computer Science, 1992, pp. 503-512.
-
(1992)
In Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science
, pp. 503-512
-
-
Ar, S.1
Lipton, R.2
Rubinfeld, R.3
Sudan, M.4
-
11
-
-
0028571367
-
Approximable sets
-
R. Beigel, M. Kummer, and F. Stephan, Approximable sets, in Proc. 9th Annual IEEE Conference on Structure in Complexity Theory, 1994, pp. 12-23.
-
(1994)
In Proc. 9th Annual IEEE Conference on Structure in Complexity Theory
, pp. 12-23
-
-
Beigel, R.1
Kummer, M.2
Stephan, F.3
-
12
-
-
0030262606
-
P-selective self-reducible sets: A new characterization of P
-
Buhrman H., Torenvliet L. P-selective self-reducible sets: A new characterization of P. J. Comp. System Sci. 53:1996;210-217.
-
(1996)
J. Comp. System Sci.
, vol.53
, pp. 210-217
-
-
Buhrman, H.1
Torenvliet, L.2
-
14
-
-
84948183117
-
On the existence of hard sparse sets under weak reductions
-
J. Cai, A. Naik, and D. Sivakumar, On the existence of hard sparse sets under weak reductions, in Proc. 13th Annual Symposium on Theoretical Aspects of Computer Science, 1996, pp. 307-318.
-
(1996)
In Proc. 13th Annual Symposium on Theoretical Aspects of Computer Science
, pp. 307-318
-
-
Cai, J.1
Naik, A.2
Sivakumar, D.3
-
15
-
-
0004457116
-
Sparse sets versus complexity classes
-
L. Hemaspaandra, & A. Selman. Springer-Verlag
-
Cai J., Ogihara M. Sparse sets versus complexity classes. Hemaspaandra L., Selman A. Complexity Theory Retrospective II. 1997;53-80 Springer-Verlag.
-
(1997)
Complexity Theory Retrospective II
, pp. 53-80
-
-
Cai, J.1
Ogihara, M.2
-
16
-
-
0023825720
-
Short propositional formulas represent nondeterministic computations
-
Cook S. Short propositional formulas represent nondeterministic computations. Inform. Process. Lett. 26:1988;269-270.
-
(1988)
Inform. Process. Lett.
, vol.26
, pp. 269-270
-
-
Cook, S.1
-
19
-
-
0029489414
-
-
[To appear in the FOCS'95
-
J. Cai and D. Sivakumar, The resolution of a Hartmanis conjecture, in Proc. 36th Annual IEEE Symposium on Foundations of Computer Science, 1995, pp. 362-373. [To appear in the FOCS'95 special issue, J. Comput. System Sci.].
-
J. Comput. System Sci.
, Issue.SPEC. ISSUE
-
-
-
20
-
-
85031622909
-
Resolution of Hartmanis' conjecture for NL-hard sparse sets
-
[To appear in the COCOON'97 special issue of Theoretical Computer Science]
-
J. Cai, and, D. Sivakumar, Resolution of Hartmanis' conjecture for NL-hard sparse sets, in, Proc. 3rd Annual Conference in Combinatorics and Computation, 1997. [To appear in the COCOON'97 special issue of Theoretical Computer Science].
-
(1997)
In, Proc. 3rd Annual Conference in Combinatorics and Computation
-
-
Cai, J.1
Sivakumar, D.2
-
21
-
-
0021420540
-
The complexity of promise problems, with applications to public-key cryptography
-
Even S., Selman A., Yacobi Y. The complexity of promise problems, with applications to public-key cryptography. Inform. and Control. 61:1984;159-173.
-
(1984)
Inform. and Control
, vol.61
, pp. 159-173
-
-
Even, S.1
Selman, A.2
Yacobi, Y.3
-
22
-
-
84919265606
-
Selectivity
-
L. Hemachandra, A. Hoene, M. Ogiwara, A. Selman, T. Thierauf, and J. Wang, Selectivity, in Proc. 5th International Conference on Computing and Information, 1993, pp. 55-59.
-
(1993)
In Proc. 5th International Conference on Computing and Information
, pp. 55-59
-
-
Hemachandra, L.1
Hoene, A.2
Ogiwara, M.3
Selman, A.4
Thierauf, T.5
Wang, J.6
-
23
-
-
0030263710
-
P-selective sets, and reducing search to decision vs. self-reducibility
-
Hemaspaandra E., Naik A., Ogihara M., Selman A. P-selective sets, and reducing search to decision vs. self-reducibility. J. Comp. System Sci. 53:1996;194-209.
-
(1996)
J. Comp. System Sci.
, vol.53
, pp. 194-209
-
-
Hemaspaandra, E.1
Naik, A.2
Ogihara, M.3
Selman, A.4
-
26
-
-
0020737382
-
On self-reducibility and weak P-selectivity
-
Ko K.-I. On self-reducibility and weak P-selectivity. J. Comp. System Sci. 26:1983;209-221.
-
(1983)
J. Comp. System Sci.
, vol.26
, pp. 209-221
-
-
Ko, K.-I.1
-
27
-
-
34250244723
-
Factoring polynomials with rational coefficients
-
Lenstra A., Lenstra H., Lovász L. Factoring polynomials with rational coefficients. Math. Ann. 261:1982;515-534.
-
(1982)
Math. Ann.
, vol.261
, pp. 515-534
-
-
Lenstra, A.1
Lenstra, H.2
Lovász, L.3
-
31
-
-
0001703864
-
On the density of families of sets
-
Sauer N. On the density of families of sets. J. Combin. Theory Ser. A. 13:1972;145-147.
-
(1972)
J. Combin. Theory Ser. a
, vol.13
, pp. 145-147
-
-
Sauer, N.1
-
32
-
-
0002973163
-
P-selective sets, tally languages, and behavior of polynomial time reducibilities on NP
-
Selman A. P-selective sets, tally languages, and behavior of polynomial time reducibilities on NP. Math. Systems Theory. 13:1979;55-65.
-
(1979)
Math. Systems Theory
, vol.13
, pp. 55-65
-
-
Selman, A.1
-
33
-
-
0000414606
-
Reductions on NP and P-selective sets
-
Selman A. Reductions on NP and P-selective sets. Theoret. Comput. Sci. 19:1982;287-304.
-
(1982)
Theoret. Comput. Sci.
, vol.19
, pp. 287-304
-
-
Selman, A.1
-
34
-
-
84972576948
-
A combinatorial problem: Stability and order for models and theories in infinitary languages
-
Shelah S. A combinatorial problem: Stability and order for models and theories in infinitary languages. Pacific J. Math. 41:1972;247-261.
-
(1972)
Pacific J. Math.
, vol.41
, pp. 247-261
-
-
Shelah, S.1
-
36
-
-
0002698373
-
On polynomial-time truth-table reducibility of intractable sets to p-selective sets
-
Toda S. On polynomial-time truth-table reducibility of intractable sets to p-selective sets. Math. Systems Theory. 24:1991;69-82.
-
(1991)
Math. Systems Theory
, vol.24
, pp. 69-82
-
-
Toda, S.1
-
39
-
-
0022911518
-
NP is as easy as detecting unique solutions
-
Valiant L., Vazirani V. NP is as easy as detecting unique solutions. Theoret. Comput. Sci. 47:1986;85-93.
-
(1986)
Theoret. Comput. Sci.
, vol.47
, pp. 85-93
-
-
Valiant, L.1
Vazirani, V.2
|