History

Please fill in your query. A complete syntax description you will find on the General Help page.

Result 41 to 60 of 170 total

Strong reductions and immunity for exponential time. (English)
Alt, Helmut (ed.) et al., STACS 2003. 20th annual symposium of theoretical aspects on computer science, Berlin, Germany, February 27 ‒ March 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-00623-0/pbk). Lect. Notes Comput. Sci. 2607, 559-570 (2003).
41
The complexity of resolution with generalized symmetry rules. (English)
Alt, Helmut (ed.) et al., STACS 2003. 20th annual symposium of theoretical aspects on computer science, Berlin, Germany, February 27 ‒ March 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-00623-0/pbk). Lect. Notes Comput. Sci. 2607, 475-486 (2003).
42
Equational theories of tropical semirings. (English)
Theor. Comput. Sci. 298, No.3, 417-469 (2003).
Classification: F.1.0 F.1.1 F.1.3
43
The max-plus algebra of the natural numbers has no finite equational basis. (English)
Theor. Comput. Sci. 293, No.1, 169-188 (2003).
44
$\cal H$-matrix approximation for the operator exponential with applications. (English)
Numer. Math. 92, No.1, 83-111 (2002).
45
Complexity theory for Lie-group solvers. (English)
J. Complexity 18, No.1, 242-286 (2002).
46
The cost of a cycle in a square. (English)
J. Symb. Log. 67, No.1, 35-60 (2002).
Reviewer: G.Mints (Stanford)
47
The set of the true regular protothetics formulas with partially ordered quantifiers is NEXPTIME-complete. (English)
Ann. Pure Appl. Logic 113, No.1-3, 53-58 (2002).
48
Axiomatizing tropical semirings. (English)
Honsell, Furio (ed.) et al., Foundations of software science and computation structures. 4th international conference, FOSSACS 2001, held as part of the joint European conferences on theory and practice of software, ETAPS 2001, Genova, Italy, April 2-6, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2030, 42-56 (2001).
49
Computational complexity of solving operator equation $(I-T)x=y$. (Chinese)
Appl. Math., Ser. A (Chin. Ed.) 16, No.3, 323-330 (2001).
50
On the complexity functions for T-ideals of associative algebras. (English)
Math. Notes 68, No.6, 751-759 (2000); translation from Mat. Zametki 68, No.6, 887-897 (2000).
51
$\cal H$-matrix approximation on graded meshes. (English)
Whiteman, J. R. (ed.), The mathematics of finite elements and applications X, MAFELAP 1999. Proceedings of the 10th conference, Brunel Univ., Uxbridge, Middlesex, GB, June 22-25, 1999. Amsterdam: Elsevier. 307-316 (2000).
52
The CREW PRAM complexity of modular inversion. (English)
SIAM J. Comput. 29, No.6, 1839-1857 (2000).
53
Randomness, stochasticity, and approximations. (English)
Theory Comput. Syst. 32, No.5, 517-529 (1999).
54
Efficient estimation of neural weights by polynomial approximation. (English)
IEEE Trans. Inf. Theory 45, No.5, 1541-1550 (1999).
55
Finite fields: theory and computation. The meeting point of number theory, computer science, coding theory and cryptography. (English)
Mathematics and its Applications (Dordrecht). 477. Dordrecht: Kluwer Academic Publishers. xiv, 528 p. Dfl. 395.00; \$237.00; \sterling 139.00 (1999). 56 Fine separation of average-time complexity classes. (English) SIAM J. Comput. 28, No.4, 1310-1325 (1999). 57 Succinctness as a source of complexity in logical formalisms. (English) Ann. Pure Appl. Logic 97, No.1-3, 231-260 (1999). 58 Towards the actual relationship between NP and exponential time. (English) Math. Log. Q. 45, No.1, 31-49 (1999). 59 A$BMAP| G| 1\$-analysis based on convolution calculus. (English)
J. Math. Sci., New York 92, No.4, 3990-4002 (1998).
Reviewer: N.Curteanu (Iaşi)
60

Result 41 to 60 of 170 total