Result 21 to 40 from 42 total
Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems. (English)
Inf. Process. Lett. 33, No.5, 221-226 (1990).
21
Lie groups and algebraic groups. Translated from the Russian by D. A. Leites. (English)
Springer Series in Soviet Mathematics. Berlin etc.: Springer-Verlag. xvii, 328 p. (1990).
22
Minimal pairs and complete problems. (English)
Theoretical aspects of computer science, Proc. 7th Annu. Symp., STACS ’90, Rouen/Fr. 1990, Lect. Notes Comput. Sci. 415, 24-36 (1990).
23
Self-reducibility structures and solutions of NP problems. (English)
Rev. Mat. Univ. Complutense Madr. 2, No.2-3, 175-184 (1989).
24
Classes of recursively enumerable sets and Q-reducibility. (English)
Math. Notes 45, No.1-2, 141-143 (1989); translation from Mat. Zametki 45, No.2, 79-82 (1989).
25
Classes of recursively enumerable sets and Q-reducibility. (Russian)
Mat. Zametki 45, No.2, 79-82 (1989).
26
On the relative complexity of hard problems for complexity classes without complete problems. (English)
Theor. Comput. Sci. 63, No.1, 43-61 (1989).
27
Linear representations of groups. Transl. from the Russian by A. Iacob. (English)
Basler Lehrbücher, 2. Basel etc.: Birkhäuser Verlag. 146 p. sFr. 40.00; DM 46.00 (1989).
28
The complete set problem in complexity classes. (Chinese)
J., Huazhong (Cent. China) Univ. Sci. Technol. 17, No.6, 73-75 (1989).
29
On completeness with respect to implicit reducibility in the logic of the first Jaśkowski matrix. (Russian)
Izv. Akad. Nauk Mold. SSR, Ser. Fiz.-Tekh. Mat. Nauk 1988, No.1, 23-28 (1988).
30
NP is as easy as detecting unique solutions. (English)
Theor. Comput. Sci. 47, 85-95 (1986).
31
On complete problems for $NP\cap C\sb 0NP$. (English)
Automata, languages and programming, 12th Colloq., Nafplion/Greece 1985, Lect. Notes Comput. Sci. 194, 250-259 (1985).
32
The complexity of promise problems with applications to public-key cryptography. (English)
Inf. Control 61, 159-173 (1984).
33
On the complexity of intersection and conjugacy problems in free groups. (English)
Theor. Comput. Sci. 32, 279-295 (1984).
34
The Nielsen reduction and P-complete problems in free groups. (English)
Theor. Comput. Sci. 32, 61-76 (1984).
35
Equivalence relations, invariants, and normal forms. II. (English)
Logic and machines: decision problems and complexity, Proc. Symp., Münster/Ger. 1983, Lect. Notes Comput. Sci. 171, 24-42 (1984).
36
Equivalence relations, invariants, and normal forms. (English)
SIAM J. Comput. 13, 682-689 (1984).
37
On certain polynomial-time truth-table reducibilities of complete sets to sparse sets. (English)
SIAM J. Comput. 12, 411-425 (1983).
38
A note on a theorem by Ladner. (English)
Inf. Process. Lett. 15, 84-86 (1982).
39
Reducibility via Zhegalkin’s linear tables. (Russian)
Sib. Mat. Zh. 21, No.3, 23-31 (1980).
40
Result 21 to 40 from 42 total
Start
Contact
Print
General Help
