Clote, Peter; Kranakis, Evangelos Boolean functions and computation models. (English) Zbl 1016.94046 Texts in Theoretical Computer Science. An EATCS Series. Berlin: Springer-Verlag. xiv, 601 p. (2002). Reviewer: Nicolae Tăndăreanu (Craiova) MSC: 94C10 68Q10 68Q17 94C05 03D15 PDFBibTeX XMLCite \textit{P. Clote} and \textit{E. Kranakis}, Boolean functions and computation models. Berlin: Springer-Verlag (2002; Zbl 1016.94046)
Kurosawa, Kaoru; Ogata, Wakaha Bit-slice auction circuit. (English) Zbl 1482.68071 Gollmann, Dieter (ed.) et al., Computer security – ESORICS 2002. 7th European symposium on research in computer security, Zurich, Switzerland, October 14–16, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2502, 24-38 (2002). MSC: 68M25 68Q06 91B26 94A60 PDFBibTeX XMLCite \textit{K. Kurosawa} and \textit{W. Ogata}, Lect. Notes Comput. Sci. 2502, 24--38 (2002; Zbl 1482.68071) Full Text: DOI
Aehlig, Klaus; Schwichtenberg, Helmut A syntactical analysis of non-size-increasing polynomial time computation. (English) Zbl 1365.03028 ACM Trans. Comput. Log. 3, No. 3, 383-401 (2002). MSC: 03D15 03B40 03F52 PDFBibTeX XMLCite \textit{K. Aehlig} and \textit{H. Schwichtenberg}, ACM Trans. Comput. Log. 3, No. 3, 383--401 (2002; Zbl 1365.03028) Full Text: DOI
Stockmeyer, Larry; Meyer, Albert R. Cosmological lower bound on the circuit complexity of a small problem in logic. (English) Zbl 1326.68153 J. ACM 49, No. 6, 753-784 (2002). MSC: 68Q17 03B25 03D15 94C10 PDFBibTeX XMLCite \textit{L. Stockmeyer} and \textit{A. R. Meyer}, J. ACM 49, No. 6, 753--784 (2002; Zbl 1326.68153) Full Text: DOI
McAllester, David On the complexity analysis of static analyses. (English) Zbl 1326.68102 J. ACM 49, No. 4, 512-537 (2002). MSC: 68N30 68N17 68Q25 PDFBibTeX XMLCite \textit{D. McAllester}, J. ACM 49, No. 4, 512--537 (2002; Zbl 1326.68102) Full Text: DOI
Ambainis, Andris; Nayak, Ashwin; Ta-Shma, Amnon; Vazirani, Umesh Dense quantum coding and quantum finite automata. (English) Zbl 1326.68133 J. ACM 49, No. 4, 496-511 (2002). MSC: 68Q05 68Q45 81P45 81P70 81P68 PDFBibTeX XMLCite \textit{A. Ambainis} et al., J. ACM 49, No. 4, 496--511 (2002; Zbl 1326.68133) Full Text: DOI
Hofmann, Martin The strength of non-size increasing computation. (English) Zbl 1323.68213 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’02, Portland, OR, USA, January 16–18, 2002. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-450-9). 260-269 (2002). MSC: 68N30 68Q05 68Q19 68Q25 68Q55 PDFBibTeX XMLCite \textit{M. Hofmann}, in: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL '02, Portland, OR, USA, January 16--18, 2002. New York, NY: Association for Computing Machinery (ACM). 260--269 (2002; Zbl 1323.68213) Full Text: DOI
Goldin, Dina Q.; Smolka, Scott A.; Wegner, Peter Turing machines, transition systems, and interaction. (English) Zbl 1260.68267 Aceto, Luca (ed.) et al., EXPRESS’01. Proceedings of the 8th international workshop on expressiveness in concurrency, a satellite workshop of CONCUR 2001, Aalborg, Denmark, August 20, 2001. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 52, No. 1, 120-136 (2002). MSC: 68Q85 68Q05 68Q15 PDFBibTeX XMLCite \textit{D. Q. Goldin} et al., Electron. Notes Theor. Comput. Sci. 52, No. 1, 120--136 (2002; Zbl 1260.68267) Full Text: DOI
Cucker, Felipe On sparseness and Turing reducibility over the reals. (English) Zbl 1261.03135 de Queiroz, Ruy (ed.) et al., WoLLIC’2002. Proceedings of the 9th workshop on logic, language, information and computation, Pontifícia Universidade Católica do Rio de Janeiro (PUC-Rio), Rio de Janeiro, Brazil, July 30–August 2, 2002. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 67, 7-14 (2002). MSC: 03D78 68Q15 68Q17 PDFBibTeX XMLCite \textit{F. Cucker}, Electron. Notes Theor. Comput. Sci. 67, 7--14 (2002; Zbl 1261.03135) Full Text: DOI
Galindo, A.; Martín-Delgado, M. A. Information and computation: classical and quantum aspects. (English) Zbl 1205.94004 Rev. Mod. Phys. 74, No. 2, 347-423 (2002). MSC: 94-02 81-02 81P68 68Q05 68Q15 94A15 94A60 PDFBibTeX XMLCite \textit{A. Galindo} and \textit{M. A. Martín-Delgado}, Rev. Mod. Phys. 74, No. 2, 347--423 (2002; Zbl 1205.94004) Full Text: DOI arXiv
Beame, Paul; Vee, Erik Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. (English) Zbl 1192.68346 Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19–21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 688-697, electronic only (2002). MSC: 68Q25 68Q05 68Q15 PDFBibTeX XMLCite \textit{P. Beame} and \textit{E. Vee}, in: Proceedings of the thirty-fourth annual ACM symposium on theory of computing, STOC 2002. Montreal, Quebec, Canada, May 19--21, 2002. New York, NY: ACM Press. 688--697 (2002; Zbl 1192.68346) Full Text: DOI
Barak, Boaz; Lindell, Yehuda Strict polynomial-time in simulation and extraction. (English) Zbl 1192.68343 Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19–21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 484-493, electronic only (2002). MSC: 68Q25 68Q10 68Q15 68Q17 PDFBibTeX XMLCite \textit{B. Barak} and \textit{Y. Lindell}, in: Proceedings of the thirty-fourth annual ACM symposium on theory of computing, STOC 2002. Montreal, Quebec, Canada, May 19--21, 2002. New York, NY: ACM Press. 484--493 (2002; Zbl 1192.68343) Full Text: DOI
Dwork, Cynthia; Stockmeyer, Larry 2-round zero knowledge and proof auditors. (English) Zbl 1192.68291 Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19–21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 322-331, electronic only (2002). MSC: 68Q15 68M12 68Q10 PDFBibTeX XMLCite \textit{C. Dwork} and \textit{L. Stockmeyer}, in: Proceedings of the thirty-fourth annual ACM symposium on theory of computing, STOC 2002. Montreal, Quebec, Canada, May 19--21, 2002. New York, NY: ACM Press. 322--331 (2002; Zbl 1192.68291) Full Text: DOI
Raz, Ran On the complexity of matrix product. (English) Zbl 1192.68327 Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19–21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 144-151, electronic only (2002). MSC: 68Q17 68Q25 68W30 PDFBibTeX XMLCite \textit{R. Raz}, in: Proceedings of the thirty-fourth annual ACM symposium on theory of computing, STOC 2002. Montreal, Quebec, Canada, May 19--21, 2002. New York, NY: ACM Press. 144--151 (2002; Zbl 1192.68327) Full Text: DOI
Hallgren, Sean Polynomial-time quantum algorithms for Pell’s equation and the principal ideal problem. (English) Zbl 1192.81069 Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19–21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 653-658, electronic only (2002). MSC: 11Y16 11Y50 68Q05 81P68 PDFBibTeX XMLCite \textit{S. Hallgren}, in: Proceedings of the thirty-fourth annual ACM symposium on theory of computing, STOC 2002. Montreal, Quebec, Canada, May 19--21, 2002. New York, NY: ACM Press. 653--658 (2002; Zbl 1192.81069) Full Text: DOI
Wocjan, P.; Janzing, D.; Beth, T. Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity. (English) Zbl 1187.81081 Quantum Inf. Comput. 2, No. 2, 117-132 (2002). MSC: 81P68 68Q25 PDFBibTeX XMLCite \textit{P. Wocjan} et al., Quantum Inf. Comput. 2, No. 2, 117--132 (2002; Zbl 1187.81081) Full Text: arXiv
Goldstine, Jonathan; Kappes, Martin; Kintala, Chandra M. R.; Leung, Hing; Malcher, Andreas; Wotschke, Detlef Descriptional complexity of machines with limited resources. (English) Zbl 1258.68058 J. UCS 8, No. 2, 193-234 (2002). MSC: 68Q05 68Q45 68Q80 PDFBibTeX XMLCite \textit{J. Goldstine} et al., J. UCS 8, No. 2, 193--234 (2002; Zbl 1258.68058) Full Text: Link
Goncharov, S. S.; Khusainov, B. Kh. Complexity of categorical theories with computable models. (English. Russian original) Zbl 1144.03307 Dokl. Math. 66, No. 1, 52-54 (2002); translation from Dokl. Akad. Nauk 385, No. 3, 299-301 (2002). MSC: 03C57 03D15 03C35 PDFBibTeX XMLCite \textit{S. S. Goncharov} and \textit{B. Kh. Khusainov}, Dokl. Math. 66, No. 1, 52--54 (2002; Zbl 1144.03307); translation from Dokl. Akad. Nauk 385, No. 3, 299--301 (2002)
Groşan, Crina; Dumitrescu, Dumitru D. A comparison of multiobjective evolutionary algorithms. (English) Zbl 1150.68375 Acta Univ. Apulensis, Math. Inform. 4, 101-110 (2002). MSC: 68Q25 68W40 90C60 PDFBibTeX XMLCite \textit{C. Groşan} and \textit{D. D. Dumitrescu}, Acta Univ. Apulensis, Math. Inform. 4, 101--110 (2002; Zbl 1150.68375) Full Text: EuDML
Kozen, Dexter On the complexity of reasoning in Kleene algebra. (English) Zbl 1096.03077 Inf. Comput. 179, No. 2, 152-162 (2002). MSC: 03G25 03B70 03D15 68Q15 PDFBibTeX XMLCite \textit{D. Kozen}, Inf. Comput. 179, No. 2, 152--162 (2002; Zbl 1096.03077) Full Text: DOI Link
Kulikov, A. S. An upper bound \(O(2^{0.16254n})\) for exact 3-satisfiability: a simpler proof. (English. Russian original) Zbl 1101.68609 J. Math. Sci., New York 126, No. 3, 1195-1199 (2005); translation from Zap. Nauch. Semin. POMI 293, 118-128 (2002). MSC: 68Q25 03D15 PDFBibTeX XMLCite \textit{A. S. Kulikov}, J. Math. Sci., New York 126, No. 3, 1195--1199 (2002; Zbl 1101.68609); translation from Zap. Nauch. Semin. POMI 293, 118--128 (2002) Full Text: DOI
Jebelean, Tudor Non-conventional algorithms for multiple precision arithmetic. (English) Zbl 1073.68655 An. Univ. Timiș., Ser. Mat.-Inform. 40, Spec. Iss., 113-119 (2002). MSC: 68Q25 11Y40 68W30 PDFBibTeX XMLCite \textit{T. Jebelean}, An. Univ. Timiș., Ser. Mat.-Inform. 40, 113--119 (2002; Zbl 1073.68655)
Montero, G.; González, L.; Flórez, E.; García, M. D.; Suárez, A. Approximate inverse computation using Frobenius inner product. (English) Zbl 1071.65534 Numer. Linear Algebra Appl. 9, No. 3, 239-247 (2002). MSC: 65F35 65F10 65Y05 65Y20 PDFBibTeX XMLCite \textit{G. Montero} et al., Numer. Linear Algebra Appl. 9, No. 3, 239--247 (2002; Zbl 1071.65534) Full Text: DOI
van den Eshof, Jasper The convergence of Jacobi-Davidson iterations for Hermitian eigenproblems. (English) Zbl 1071.65518 Numer. Linear Algebra Appl. 9, No. 2, 163-179 (2002). MSC: 65F15 65F35 65Y20 PDFBibTeX XMLCite \textit{J. van den Eshof}, Numer. Linear Algebra Appl. 9, No. 2, 163--179 (2002; Zbl 1071.65518) Full Text: DOI
Kaporin, Igor E.; Konshin, Igor N. A parallel block overlap preconditioning with inexact submatrix inversion for linear elasticity problems. (English) Zbl 1071.65513 Numer. Linear Algebra Appl. 9, No. 2, 141-162 (2002). MSC: 65F10 65F35 65Y05 65Y20 PDFBibTeX XMLCite \textit{I. E. Kaporin} and \textit{I. N. Konshin}, Numer. Linear Algebra Appl. 9, No. 2, 141--162 (2002; Zbl 1071.65513) Full Text: DOI
Magolu monga Made, M.; van der Vorst, Henk A. Spectral analysis of parallel incomplete factorizations with implicit pseudo-overlap. (English) Zbl 1071.65557 Numer. Linear Algebra Appl. 9, No. 1, 45-64 (2002). MSC: 65N55 65F35 65Y05 65Y20 PDFBibTeX XMLCite \textit{M. Magolu monga Made} and \textit{H. A. van der Vorst}, Numer. Linear Algebra Appl. 9, No. 1, 45--64 (2002; Zbl 1071.65557) Full Text: DOI Link
Bindel, David; Demmel, James; Kahan, William; Marques, Osni On computing Givens rotations reliably and efficiently. (English) Zbl 1072.65048 ACM Trans. Math. Softw. 28, No. 2, 206-238 (2002). MSC: 65F15 15-04 65Y15 65Y20 PDFBibTeX XMLCite \textit{D. Bindel} et al., ACM Trans. Math. Softw. 28, No. 2, 206--238 (2002; Zbl 1072.65048) Full Text: DOI
Jonsson, Isak; Kågström, Bo Recursive blocked algorithms for solving triangular systems. II: two-sided and generalized Sylvester and Lyapunov matrix equations. (English) Zbl 1072.65062 ACM Trans. Math. Softw. 28, No. 4, 416-435 (2002). MSC: 65F30 15A24 65F50 65Y20 65Y05 PDFBibTeX XMLCite \textit{I. Jonsson} and \textit{B. Kågström}, ACM Trans. Math. Softw. 28, No. 4, 416--435 (2002; Zbl 1072.65062) Full Text: DOI
Jonsson, Isak; Kågström, Bo Recursive blocked algorithms for solving triangular systems. I: One-sided and coupled Sylvester-type matrix equations. (English) Zbl 1072.65061 ACM Trans. Math. Softw. 28, No. 4, 392-415 (2002). MSC: 65F30 15A24 65Y05 65Y20 65F50 PDFBibTeX XMLCite \textit{I. Jonsson} and \textit{B. Kågström}, ACM Trans. Math. Softw. 28, No. 4, 392--415 (2002; Zbl 1072.65061) Full Text: DOI
Gupta, Anshul Recent advances in direct methods for solving unsymmetric sparse systems of linear equations. (English) Zbl 1072.65039 ACM Trans. Math. Softw. 28, No. 3, 301-324 (2002). MSC: 65F05 65F50 65Y05 65Y20 PDFBibTeX XMLCite \textit{A. Gupta}, ACM Trans. Math. Softw. 28, No. 3, 301--324 (2002; Zbl 1072.65039) Full Text: DOI
Gansterer, Wilfried N.; Ward, Robert C.; Muller, Richard P. An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems. (English) Zbl 1072.65050 ACM Trans. Math. Softw. 28, No. 1, 45-58 (2002). MSC: 65F15 65Y20 65F50 PDFBibTeX XMLCite \textit{W. N. Gansterer} et al., ACM Trans. Math. Softw. 28, No. 1, 45--58 (2002; Zbl 1072.65050) Full Text: DOI
Pan, Victor Y.; Wang, Xinmao Acceleration of Euclidean algorithm and extensions. (English) Zbl 1072.68691 Mora, Teo (ed.), ISSAC 2002. Proceedings of the 2002 international symposium on symbolic and algebraic computation, Lille, France, July 07–10, 2002. New York, NY: ACM Press (ISBN 1-58113-484-3/pbk). 207-213 (2002). MSC: 68W30 11Y16 68W20 11A05 15B36 15A06 15B05 PDFBibTeX XMLCite \textit{V. Y. Pan} and \textit{X. Wang}, in: Proceedings of the 2002 international symposium on symbolic and algebraic computation, ISSAC 2002, Lille, France, July 07--10, 2002. New York, NY: ACM Press. 207--213 (2002; Zbl 1072.68691) Full Text: DOI
Kogan, Irina A.; Moreno Maza, Marc Computation of canonical forms for ternary cubics. (English) Zbl 1072.68629 Mora, Teo (ed.), ISSAC 2002. Proceedings of the 2002 international symposium on symbolic and algebraic computation, Lille, France, July 07–10, 2002. New York, NY: ACM Press (ISBN 1-58113-484-3/pbk). 151-160 (2002). MSC: 68U05 68W30 14Q20 PDFBibTeX XMLCite \textit{I. A. Kogan} and \textit{M. Moreno Maza}, in: Proceedings of the 2002 international symposium on symbolic and algebraic computation, ISSAC 2002, Lille, France, July 07--10, 2002. New York, NY: ACM Press. 151--160 (2002; Zbl 1072.68629)
Tetruashvili, M. Computational complexity of the inequality problem for one class of semigroups. (English) Zbl 1064.03028 Appl. Math. Inform. 7, No. 1, 87-91 (2002). Reviewer: Jerzy Mycka (Lublin) MSC: 03D15 03D40 06F05 PDFBibTeX XMLCite \textit{M. Tetruashvili}, Appl. Math. Inform. 7, No. 1, 87--91 (2002; Zbl 1064.03028)
Schwichtenberg, Helmut; Bellantoni, Stephen J. Feasible computation with higher types. (English) Zbl 1064.03030 Schwichtenberg, Helmut (ed.) et al., Proof and system-reliability. Proceedings of the NATO Advanced Study Institute, Marktoberdorf, Germany, July 24 – August 5, 2001. Dordrecht: Kluwer Academic Publishers (ISBN 1-4020-0607-1/hbk). NATO Sci. Ser. II, Math. Phys. Chem. 62, 399-415 (2002). Reviewer: R. Downey (Wellington) MSC: 03D65 03D15 68Q15 PDFBibTeX XMLCite \textit{H. Schwichtenberg} and \textit{S. J. Bellantoni}, NATO Sci. Ser. II, Math. Phys. Chem. 62, 399--415 (2002; Zbl 1064.03030)
Ostrin, G. E.; Wainer, S. S. Proof theoretic complexity. (English) Zbl 1057.03048 Schwichtenberg, Helmut (ed.) et al., Proof and system-reliability. Proceedings of the NATO Advanced Study Institute, Marktoberdorf, Germany, July 24 – August 5, 2001. Dordrecht: Kluwer Academic Publishers (ISBN 1-4020-0607-1/hbk). NATO Sci. Ser. II, Math. Phys. Chem. 62, 369-397 (2002). MSC: 03F20 03F30 03D20 03D15 03F05 PDFBibTeX XMLCite \textit{G. E. Ostrin} and \textit{S. S. Wainer}, NATO Sci. Ser. II, Math. Phys. Chem. 62, 369--397 (2002; Zbl 1057.03048)
Constable, Robert L. Naïve computational type theory. (English) Zbl 1127.03322 Schwichtenberg, Helmut (ed.) et al., Proof and system-reliability. Proceedings of the NATO Advanced Study Institute, Marktoberdorf, Germany, July 24 – August 5, 2001. Dordrecht: Kluwer Academic Publishers (ISBN 1-4020-0607-1/hbk). NATO Sci. Ser. II, Math. Phys. Chem. 62, 213-259 (2002). MSC: 03B40 03F35 68N18 68Q05 68Q25 PDFBibTeX XMLCite \textit{R. L. Constable}, NATO Sci. Ser. II, Math. Phys. Chem. 62, 213--259 (2002; Zbl 1127.03322)
Jones, Neil D. Computability and complexity from a programming perspective. (English) Zbl 1097.68565 Schwichtenberg, Helmut (ed.) et al., Proof and system-reliability. Proceedings of the NATO Advanced Study Institute, Marktoberdorf, Germany, July 24 – August 5, 2001. Dordrecht: Kluwer Academic Publishers (ISBN 1-4020-0607-1/hbk). NATO Sci. Ser. II, Math. Phys. Chem. 62, 79-135 (2002). MSC: 68Q05 68Q15 03D20 PDFBibTeX XMLCite \textit{N. D. Jones}, NATO Sci. Ser. II, Math. Phys. Chem. 62, 79--135 (2002; Zbl 1097.68565)
Hudry, Olivier Turing machines and algorithmic complexity. (Machines de Turing et complexité algorithmique.) (French) Zbl 1061.68534 Serfati, Michel (ed.), On the method. Recherches on the history and philosophy of mathematics. Papers of the communications of the seminar on epistemology and the colloquium on philosophy and mathematics held at the IREM, Paris, France. Paris: Presses Universitaires Franc-Comtoises (ISBN 2-84867-000-2/pbk). Colloques et Séminaires, 177-213 (2002). MSC: 68Q05 03D10 68-01 68Q15 68Q17 68Q25 90C27 90C60 PDFBibTeX XMLCite \textit{O. Hudry}, in: De la méthode. Recherches en histoire et philosophie des mathématiques. Paris: Presses Universitaires Franc-Comtoises. 177--213 (2002; Zbl 1061.68534)
Gaĭnutdinova, A. F. On relative complexity of quantum and classical branching programs. (English. Russian original) Zbl 1048.81016 Discrete Math. Appl. 12, No. 5, 515-526 (2002); translation from Diskretn. Mat. 14, No. 3, 109-121 (2002). MSC: 81P68 68Q05 68Q25 PDFBibTeX XMLCite \textit{A. F. Gaĭnutdinova}, Discrete Math. Appl. 12, No. 5, 515--526 (2002; Zbl 1048.81016); translation from Diskretn. Mat. 14, No. 3, 109--121 (2002)
Edalat, Abbas; Heckmann, Reinhold Computing with real numbers. I. The LFT approach to real number computation. II. A domain framework for computational geometry. (English) Zbl 1065.68053 Barthe, Gilles (ed.) et al., Applied semantics. International summer school, APPSEM 2000, Caminha, Portugal, September 9–15, 2000. Advanced lectures. Berlin: Springer (ISBN 3-540-44044-5). Lect. Notes Comput. Sci. 2395, 193-267 (2002). MSC: 68Q05 68Q25 68U05 PDFBibTeX XMLCite \textit{A. Edalat} and \textit{R. Heckmann}, Lect. Notes Comput. Sci. 2395, 193--267 (2002; Zbl 1065.68053) Full Text: Link
Mayr, Ernst W. Complexity theory and algorithms. (English) Zbl 1068.68704 Monien, Burkhard (ed.) et al., Euro-Par 2002 Parallel processing. 8th international Euro-Par conference, Paderborn, Germany, August 27–30, 2002. Proceedings. Berlin: Springer (ISBN 3-540-44049-6). Lect. Notes Comput. Sci. 2400, 391 (2002). MSC: 68W10 68Q10 68Q15 68Q25 65Y05 PDFBibTeX XMLCite \textit{E. W. Mayr}, Lect. Notes Comput. Sci. 2400, 391 (2002; Zbl 1068.68704) Full Text: Link
Kupferman, Orna; Sattler, Ulrike; Vardi, Moshe Y. The complexity of the graded \(\mu\)-calculus. (English) Zbl 1072.03014 Voronkov, Andrei (ed.), Automated deduction - CADE-18. 18th international conference, Copenhagen, Denmark, July 27–30, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43931-5). Lect. Notes Comput. Sci. 2392, 423-437 (2002). MSC: 03B45 03D05 03D15 03B35 68Q17 68Q60 PDFBibTeX XMLCite \textit{O. Kupferman} et al., Lect. Notes Comput. Sci. 2392, 423--437 (2002; Zbl 1072.03014) Full Text: Link
Egly, Uwe Embedding lax logic into intuitionistic logic. (English) Zbl 1072.03013 Voronkov, Andrei (ed.), Automated deduction - CADE-18. 18th international conference, Copenhagen, Denmark, July 27–30, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43931-5). Lect. Notes Comput. Sci. 2392, 78-93 (2002). MSC: 03B45 03B20 03D15 68Q17 PDFBibTeX XMLCite \textit{U. Egly}, Lect. Notes Comput. Sci. 2392, 78--93 (2002; Zbl 1072.03013) Full Text: Link
Castaing, Jacqueline Non-commutative logic for hand-written character modeling. (English) Zbl 1072.68548 Calmet, Jacques (ed.) et al., Artificial intelligence, automated reasoning, and symbolic computation. Joint international conferences: AISC 2002, the 6th international conference on artificial intelligence and symbolic computation, and Calculemus 2002, the 10th symposium on the integration of symbolic computation and mechanized reasoning. Marseille, France, July 1–5, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43865-3). Lect. Notes Comput. Sci. 2385, 136-153 (2002). MSC: 68T10 03F52 68W30 PDFBibTeX XMLCite \textit{J. Castaing}, Lect. Notes Comput. Sci. 2385, 136--153 (2002; Zbl 1072.68548) Full Text: Link
Fagan, M.; Carle, A. Switchback: Profile-driven recomputation for reverse mode. (English) Zbl 1062.65021 Sloot, Peter M. A. (ed.) et al., Computational science - ICCS 2002. 2nd international conference, Amsterdam, the Netherlands, April. 21–24, 2002. Proceedings. Part 2. Berlin: Springer (ISBN 3-540-43593-X). Lect. Notes Comput. Sci. 2330, 1029-1038 (2002). MSC: 65D25 68W30 65Y20 PDFBibTeX XMLCite \textit{M. Fagan} and \textit{A. Carle}, Lect. Notes Comput. Sci. 2330, 1029--1038 (2002; Zbl 1062.65021) Full Text: Link
Seguel, J.; Bollman, D.; Orozco, E. A new prime edge length crystallographic FFT. (English) Zbl 1062.65151 Sloot, Peter M. A. (ed.) et al., Computational science - ICCS 2002. 2nd international conference, Amsterdam, the Netherlands, April. 21–24, 2002. Proceedings. Part 2. Berlin: Springer (ISBN 3-540-43593-X). Lect. Notes Comput. Sci. 2330, 548-557 (2002). MSC: 65T50 82D25 78A45 PDFBibTeX XMLCite \textit{J. Seguel} et al., Lect. Notes Comput. Sci. 2330, 548--557 (2002; Zbl 1062.65151) Full Text: Link
Herrero, H.; Castillo, E.; Pruneda, R. E. Orthogonal method for linear systems. Preconditioning. (English) Zbl 1062.65033 Sloot, Peter M. A. (ed.) et al., Computational science - ICCS 2002. 2nd international conference, Amsterdam, the Netherlands, April. 21–24, 2002. Proceedings. Part 2. Berlin: Springer (ISBN 3-540-43593-X). Lect. Notes Comput. Sci. 2330, 374-382 (2002). MSC: 65F05 65F35 65Y20 PDFBibTeX XMLCite \textit{H. Herrero} et al., Lect. Notes Comput. Sci. 2330, 374--382 (2002; Zbl 1062.65033) Full Text: Link
Schenk, O.; Gärtner, K. Solving unsymmetric sparse systems of linear equations with PARDISO. (English) Zbl 1062.65035 Sloot, Peter M. A. (ed.) et al., Computational science - ICCS 2002. 2nd international conference, Amsterdam, the Netherlands, April. 21–24, 2002. Proceedings. Part 2. Berlin: Springer (ISBN 3-540-43593-X). Lect. Notes Comput. Sci. 2330, 355-363 (2002). MSC: 65F05 65F50 65Y05 65Y20 PDFBibTeX XMLCite \textit{O. Schenk} and \textit{K. Gärtner}, Lect. Notes Comput. Sci. 2330, 355--363 (2002; Zbl 1062.65035) Full Text: Link
Cai, X.; Saad, Y.; Sosonkina, M. Parallel iterative methods in modern physical applications. (English) Zbl 1062.65040 Sloot, Peter M. A. (ed.) et al., Computational science - ICCS 2002. 2nd international conference, Amsterdam, the Netherlands, April. 21–24, 2002. Proceedings. Part 2. Berlin: Springer (ISBN 3-540-43593-X). Lect. Notes Comput. Sci. 2330, 345-354 (2002). MSC: 65F10 65F50 65Y05 65Y20 PDFBibTeX XMLCite \textit{X. Cai} et al., Lect. Notes Comput. Sci. 2330, 345--354 (2002; Zbl 1062.65040) Full Text: Link
Irony, D.; Shklarski, G.; Toledo, S. Parallel and fully recursive multifrontal supernodal sparse Cholesky. (English) Zbl 1062.65034 Sloot, Peter M. A. (ed.) et al., Computational science - ICCS 2002. 2nd international conference, Amsterdam, the Netherlands, April. 21–24, 2002. Proceedings. Part 2. Berlin: Springer (ISBN 3-540-43593-X). Lect. Notes Comput. Sci. 2330, 335-344 (2002). MSC: 65F05 65F50 65Y05 65Y20 PDFBibTeX XMLCite \textit{D. Irony} et al., Lect. Notes Comput. Sci. 2330, 335--344 (2002; Zbl 1062.65034) Full Text: Link
Bhowmick, S.; Raghavan, P.; Teranishi, K. A combinatorial scheme for developing efficient composite solvers. (English) Zbl 1062.65029 Sloot, Peter M. A. (ed.) et al., Computational science - ICCS 2002. 2nd international conference, Amsterdam, the Netherlands, April. 21–24, 2002. Proceedings. Part 2. Berlin: Springer (ISBN 3-540-43593-X). Lect. Notes Comput. Sci. 2330, 325-334 (2002). MSC: 65F05 65Y20 68W30 65F50 PDFBibTeX XMLCite \textit{S. Bhowmick} et al., Lect. Notes Comput. Sci. 2330, 325--334 (2002; Zbl 1062.65029) Full Text: Link
Ishai, Yuval; Kushilevitz, Eyal Perfect constant-round secure computation via perfect randomizing polynomials. (English) Zbl 1056.68088 Widmayer, Peter (ed.) et al., Automata, languages and programming. 29th international colloquium, ICALP 2002, Málaga, Spain, July 8–13, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43864-5). Lect. Notes Comput. Sci. 2380, 244-256 (2002). MSC: 68Q10 94A60 68Q25 PDFBibTeX XMLCite \textit{Y. Ishai} and \textit{E. Kushilevitz}, Lect. Notes Comput. Sci. 2380, 244--256 (2002; Zbl 1056.68088) Full Text: Link
Pavan, A.; Selman, Alan L. Bi-immunity separates strong NP-completeness notions. (English) Zbl 1054.68067 Alt, Helmut (ed.) et al., STACS 2002. 19th annual symposium on theoretical aspects of computer science. Antibes - Juan les Pins, France, March 14–16, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43283-3). Lect. Notes Comput. Sci. 2285, 408-418 (2002). MSC: 68Q15 68Q17 03D15 PDFBibTeX XMLCite \textit{A. Pavan} and \textit{A. L. Selman}, Lect. Notes Comput. Sci. 2285, 408--418 (2002; Zbl 1054.68067) Full Text: Link
Høyer, Peter; de Wolf, Ronald Improved quantum communication complexity bounds for disjointness and equality. (English) Zbl 1054.68064 Alt, Helmut (ed.) et al., STACS 2002. 19th annual symposium on theoretical aspects of computer science. Antibes - Juan les Pins, France, March 14–16, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43283-3). Lect. Notes Comput. Sci. 2285, 299-310 (2002). MSC: 68Q15 68Q05 81P68 PDFBibTeX XMLCite \textit{P. Høyer} and \textit{R. de Wolf}, Lect. Notes Comput. Sci. 2285, 299--310 (2002; Zbl 1054.68064) Full Text: Link
Pan, Victor Y. Randomized acceleration of fundamental matrix computations. (English) Zbl 1054.68830 Alt, Helmut (ed.) et al., STACS 2002. 19th annual symposium on theoretical aspects of computer science. Antibes - Juan les Pins, France, March 14–16, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43283-3). Lect. Notes Comput. Sci. 2285, 215-226 (2002). MSC: 68W20 68W30 65Fxx 15B36 PDFBibTeX XMLCite \textit{V. Y. Pan}, Lect. Notes Comput. Sci. 2285, 215--226 (2002; Zbl 1054.68830) Full Text: Link
Szegedy, Mario; Chen, Xiaomin Computing Boolean functions from multiple faulty copies of input bits. (English) Zbl 1059.68575 Rajsbaum, Sergio (ed.), LATIN 2002: Theoretical informatics. 5th Latin American symposium, Cancun, Mexico, April 3–6, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43400-3). Lect. Notes Comput. Sci. 2286, 539-553 (2002). MSC: 68Q05 68Q17 68Q25 68R05 90C09 94C12 PDFBibTeX XMLCite \textit{M. Szegedy} and \textit{X. Chen}, Lect. Notes Comput. Sci. 2286, 539--553 (2002; Zbl 1059.68575) Full Text: Link
Turull Torres, José María Relational databases and homogeneity in logics with counting. (English) Zbl 1044.68048 Eiter, Thomas (ed.) et al., Foundations of information and knowledge systems. 2nd international symposium, FoIKS 2002, Salzau Castle, Germany, February 20–23, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43220-5). Lect. Notes Comput. Sci. 2284, 212-229 (2002). MSC: 68P15 68Q05 03B70 03D15 PDFBibTeX XMLCite \textit{J. M. Turull Torres}, Lect. Notes Comput. Sci. 2284, 212--229 (2002; Zbl 1044.68048) Full Text: Link
Chaitin, Gregory Information and chance. (Spanish) Zbl 1140.68406 Bol. Asoc. Mat. Venez. 9, No. 1, 35-81 (2002). MSC: 68Q30 03D15 94A15 PDFBibTeX XMLCite \textit{G. Chaitin}, Bol. Asoc. Mat. Venez. 9, No. 1, 35--81 (2002; Zbl 1140.68406) Full Text: EMIS
Kutrib, Martin Refining nondeterminism below linear time. (English) Zbl 1095.68594 J. Autom. Lang. Comb. 7, No. 4, 533-547 (2002). MSC: 68Q05 68Q10 68Q15 PDFBibTeX XMLCite \textit{M. Kutrib}, J. Autom. Lang. Comb. 7, No. 4, 533--547 (2002; Zbl 1095.68594)
Zhao, Yunlei; Zhu, Hong Present random computations in a uniform way. (English) Zbl 1070.68041 Prog. Nat. Sci. 12, No. 11, 878-880 (2002). MSC: 68Q05 68Q10 68Q15 PDFBibTeX XMLCite \textit{Y. Zhao} and \textit{H. Zhu}, Prog. Nat. Sci. 12, No. 11, 878--880 (2002; Zbl 1070.68041)
Barak, Boaz A probabilistic-time hierarchy theorem for “slightly non-uniform” algorithms. (English) Zbl 1028.68058 Rolim, José D. P. (ed.) et al., Randomization and approximation techniques in computer science. 6th international workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2483, 194-208 (2002). MSC: 68Q15 68Q05 68Q10 PDFBibTeX XMLCite \textit{B. Barak}, Lect. Notes Comput. Sci. 2483, 194--208 (2002; Zbl 1028.68058) Full Text: Link
Yamakami, Tomoyuki Quantum optimization problems. (English) Zbl 1029.68554 Calude, Cristian S. (ed.) et al., Unconventional models of computation. Third international conference, UMC 2002, Kobe, Japan, October 15-19, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2509, 300-314 (2002). MSC: 68Q05 81P68 68T20 90C27 68Q15 68Q17 PDFBibTeX XMLCite \textit{T. Yamakami}, Lect. Notes Comput. Sci. 2509, 300--314 (2002; Zbl 1029.68554) Full Text: arXiv Link
Ozawa, Masanao Halting of quantum Turing machines. (English) Zbl 1029.68062 Calude, Cristian S. (ed.) et al., Unconventional models of computation. Third international conference, UMC 2002, Kobe, Japan, October 15-19, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2509, 58-65 (2002). MSC: 68Q05 81P68 68Q30 PDFBibTeX XMLCite \textit{M. Ozawa}, Lect. Notes Comput. Sci. 2509, 58--65 (2002; Zbl 1029.68062) Full Text: Link
Campagnolo, Manuel Lameiras The complexity of real recursive functions. (English) Zbl 1029.03034 Calude, Cristian S. (ed.) et al., Unconventional models of computation. Third international conference, UMC 2002, Kobe, Japan, October 15-19, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2509, 1-14 (2002). MSC: 03D65 03D20 03D15 PDFBibTeX XMLCite \textit{M. L. Campagnolo}, Lect. Notes Comput. Sci. 2509, 1--14 (2002; Zbl 1029.03034) Full Text: Link
Gravvanis, George A. Explicit preconditioned domain decomposition schemes. (English) Zbl 1031.65053 Int. J. Comput. Numer. Anal. Appl. 2, No. 1, 19-36 (2002). MSC: 65F10 65N06 65Y20 35J25 65F35 65Y05 65N55 PDFBibTeX XMLCite \textit{G. A. Gravvanis}, Int. J. Comput. Numer. Anal. Appl. 2, No. 1, 19--36 (2002; Zbl 1031.65053)
Damm, Carsten; Holzer, Markus; McKenzie, Pierre The complexity of tensor calculus. (English) Zbl 1033.15025 Comput. Complexity 11, No. 1-2, 54-89 (2002). Reviewer: Yueh-er Kuo (Knoxville) MSC: 15A69 68Q05 03D10 03D40 68R15 68Q15 68Q17 68Q70 PDFBibTeX XMLCite \textit{C. Damm} et al., Comput. Complexity 11, No. 1--2, 54--89 (2002; Zbl 1033.15025) Full Text: DOI
Goldreich, Oded; Vadhan, Salil; Wigderson, Avi On interactive proofs with a laconic prover. (English) Zbl 1053.68045 Comput. Complexity 11, No. 1-2, 1-53 (2002). MSC: 68Q05 68Q10 68Q15 03F20 91A80 PDFBibTeX XMLCite \textit{O. Goldreich} et al., Comput. Complexity 11, No. 1--2, 1--53 (2002; Zbl 1053.68045) Full Text: DOI
Lutz, Carsten; Sattler, Ulrike The complexity of reasoning with Boolean modal logics. (English) Zbl 1031.03037 Wolter, Frank (ed.) et al., Advances in modal logic. Vol. 3. Proceedings of the 3rd AiML workshop, Leipzig, Germany, October 4-7, 2000. Singapore: World Scientific. 329-348 (2002). MSC: 03B45 68T27 03D15 PDFBibTeX XMLCite \textit{C. Lutz} and \textit{U. Sattler}, in: Advances in modal logic. Vol. 3. Proceedings of the 3rd AiML workshop, Leipzig, Germany, October 4--7, 2000. Singapore: World Scientific. 329--348 (2002; Zbl 1031.03037)
Demri, Stéphane Modal logics with weak forms of recursion: PSPACE specimens. (English) Zbl 1031.03031 Wolter, Frank (ed.) et al., Advances in modal logic. Vol. 3. Proceedings of the 3rd AiML workshop, Leipzig, Germany, October 4-7, 2000. Singapore: World Scientific. 113-138 (2002). MSC: 03B45 03D15 03B70 03F20 68Q42 PDFBibTeX XMLCite \textit{S. Demri}, in: Advances in modal logic. Vol. 3. Proceedings of the 3rd AiML workshop, Leipzig, Germany, October 4--7, 2000. Singapore: World Scientific. 113--138 (2002; Zbl 1031.03031)
Petcu, Dana Connected mathematical software kernels: A solution for large IVP integration. (English) Zbl 1028.65083 Lipitakis, Elias A. (ed.), HERCMA 2001. Proceedings of the 5th Hellenic-European conference on computer mathematics and its applications, Athens, Greece, September 20-22, 2001. 2 volumes. Athens: LEA. 613-620 (2002). MSC: 65L05 65M20 65L06 34A34 65Y05 65Y20 PDFBibTeX XMLCite \textit{D. Petcu}, in: HERCMA 2001. Proceedings of the 5th Hellenic-European conference on computer mathematics and its applications, Athens, Greece, September 20--22, 2001. 2 volumes. Athens: LEA. 613--620 (2002; Zbl 1028.65083)
Aguzzoli, Stefano; Gerla, Brunella Finite-valued reductions of infinite-valued logics. (English) Zbl 1032.03017 Arch. Math. Logic 41, No. 4, 361-399 (2002). Reviewer: Albert Hoogewijs (Gent) MSC: 03B50 03B22 03B25 03D15 PDFBibTeX XMLCite \textit{S. Aguzzoli} and \textit{B. Gerla}, Arch. Math. Logic 41, No. 4, 361--399 (2002; Zbl 1032.03017) Full Text: DOI
Wang, Yongge The algebraic structure of the isomorphic types of tally, polynomial time computable sets. (English) Zbl 1022.03020 Arch. Math. Logic 41, No. 3, 215-244 (2002). MSC: 03D15 03D25 03D30 PDFBibTeX XMLCite \textit{Y. Wang}, Arch. Math. Logic 41, No. 3, 215--244 (2002; Zbl 1022.03020) Full Text: DOI
Cantini, Andrea Polytime, combinatory logic and positive safe induction. (English) Zbl 1042.03015 Arch. Math. Logic 41, No. 2, 169-189 (2002). Reviewer: Reinhard Kahle (Coimbra) MSC: 03B40 03F30 03D15 03F50 68Q15 PDFBibTeX XMLCite \textit{A. Cantini}, Arch. Math. Logic 41, No. 2, 169--189 (2002; Zbl 1042.03015) Full Text: DOI
Oitavem, Isabel A term rewriting characterization of the functions computable in polynomial space. (English) Zbl 1022.03013 Arch. Math. Logic 41, No. 1, 35-47 (2002). MSC: 03B70 03D15 03D20 68Q42 PDFBibTeX XMLCite \textit{I. Oitavem}, Arch. Math. Logic 41, No. 1, 35--47 (2002; Zbl 1022.03013) Full Text: DOI
Beckmann, Arnold A note on universal measures for weak implicit computational complexity. (English) Zbl 1023.03033 Baaz, Matthias (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 9th international conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2514, 53-67 (2002). MSC: 03D15 03D10 03F30 03F15 PDFBibTeX XMLCite \textit{A. Beckmann}, Lect. Notes Comput. Sci. 2514, 53--67 (2002; Zbl 1023.03033) Full Text: Link
Shkarupa, E. V. The use of a quantum computer for global estimation of an integral depending on a parameter. (Russian. English summary) Zbl 1027.65006 Sib. Zh. Vychisl. Mat. 5, No. 4, 381-394 (2002). MSC: 65C05 81P68 68Q05 PDFBibTeX XMLCite \textit{E. V. Shkarupa}, Sib. Zh. Vychisl. Mat. 5, No. 4, 381--394 (2002; Zbl 1027.65006)
Fischer, Wieland; Seifert, Jean-Pierre Increasing the bitlength of a crypto-coprocessor. (English) Zbl 1020.94517 Kaliski, Burton S. jun. (ed.) et al., Cryptographic hardware and embedded systems - CHES 2002. 4th international workshop, Redwood Shores, CA, USA, August 13-15, 2002. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2523, 71-81 (2002). MSC: 94A60 11Y16 68M07 68W30 PDFBibTeX XMLCite \textit{W. Fischer} and \textit{J.-P. Seifert}, Lect. Notes Comput. Sci. 2523, 71--81 (2002; Zbl 1020.94517) Full Text: Link
Faure, Christèle Automatic differentiation platform: design. (English) Zbl 1024.65020 M2AN, Math. Model. Numer. Anal. 36, No. 5, 783-792 (2002). MSC: 65D25 65Y20 68W30 PDFBibTeX XMLCite \textit{C. Faure}, M2AN, Math. Model. Numer. Anal. 36, No. 5, 783--792 (2002; Zbl 1024.65020) Full Text: DOI Numdam EuDML
Grötschel, Martin \(\mathcal P = \mathcal{NP}\)? (German) Zbl 1022.68064 Elem. Math. 57, No. 3, 96-102 (2002). MSC: 68Q15 68-01 03-01 03D15 PDFBibTeX XMLCite \textit{M. Grötschel}, Elem. Math. 57, No. 3, 96--102 (2002; Zbl 1022.68064) Full Text: DOI
Sendra, J. Rafael; Villarino, Carlos Algebraically optimal parametrizations of quasi-polynomial algebraic curves. (English) Zbl 1052.14073 J. Algebra Appl. 1, No. 1, 51-74 (2002). MSC: 14Q05 14Q20 68W30 PDFBibTeX XMLCite \textit{J. R. Sendra} and \textit{C. Villarino}, J. Algebra Appl. 1, No. 1, 51--74 (2002; Zbl 1052.14073) Full Text: DOI
Jain, Rahul; Radhakrishnan, Jaikumar; Sen, Pranab The quantum communication complexity of the pointer chasing problem: The bit version. (English) Zbl 1027.68065 Agrawal, Manindra (ed.) et al., FST TCS 2002: Foundations of software technology and theoretical computer science. 22nd conference, Kanpur, India, December 12-14, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2556, 218-229 (2002). MSC: 68Q25 81P68 90B18 94A17 68Q17 PDFBibTeX XMLCite \textit{R. Jain} et al., Lect. Notes Comput. Sci. 2556, 218--229 (2002; Zbl 1027.68065) Full Text: Link
Chen, Jun; Yuan, Guoxing; Li, Xiaomei Performance analysis of the tracer interfaces moving grid method program. (English. Chinese original) Zbl 1026.65139 Chin. J. Numer. Math. Appl. 24, No. 4, 7-17 (2002); translation from J. Numer. Methods Comput. Appl. 23 2002, No. 3, 167-175 (2002). MSC: 65Y20 65F35 65Y05 65M06 65M50 PDFBibTeX XMLCite \textit{J. Chen} et al., Chin. J. Numer. Math. Appl. 24, No. 4, 7--17 (2002; Zbl 1026.65139); translation from J. Numer. Methods Comput. Appl. 23 2002, No. 3, 167--175 (2002)
Leivant, Daniel Implicit computational complexity for higher type functionals (extended abstract). (English) Zbl 1020.03511 Bradfield, Julian (ed.), Computer science logic. 16th international workshop, CSL 2002, 11th annual conference of the EACSL, Edinburgh, Scotland, GB, September 22-25, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2471, 367-381 (2002). MSC: 03D65 68N18 03D15 03B70 PDFBibTeX XMLCite \textit{D. Leivant}, Lect. Notes Comput. Sci. 2471, 367--381 (2002; Zbl 1020.03511) Full Text: Link
Marcinkowski, Jerzy; Truderung, Tomasz Optimal complexity bounds for positive LTL games. (English) Zbl 1020.03027 Bradfield, Julian (ed.), Computer science logic. 16th international workshop, CSL 2002, 11th annual conference of the EACSL, Edinburgh, Scotland, GB, September 22-25, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2471, 262-275 (2002). MSC: 03B70 03B44 68Q17 03D05 91A43 68Q25 03D15 PDFBibTeX XMLCite \textit{J. Marcinkowski} and \textit{T. Truderung}, Lect. Notes Comput. Sci. 2471, 262--275 (2002; Zbl 1020.03027) Full Text: Link
Gubareni, Nadiya Convergence and performance of parallel multiplicative algorithm for image reconstruction from total image. (English) Zbl 1031.65146 HERMIS-\(\mu\pi\) 3, 209-216 (2002). Reviewer: Przemyslaw Stpiczynski (Lublin) MSC: 65R10 65Y05 65R30 44A12 92C55 65Y20 PDFBibTeX XMLCite \textit{N. Gubareni}, HERMIS-\(\mu\pi\) 3, 209--216 (2002; Zbl 1031.65146)
Purcz, Pavol Communication complexity of a parallel algorithm for the explicit difference method. (English) Zbl 1031.65099 Kmeť, Stanislav (ed.) et al., Proceedings of the 7th international scientific conference. Section 1: Applied mathematics, Košice, May 22-24, 2002. Košice: Technical University of Košice, Civil Engineering Faculty. 62-68 (2002). MSC: 65M06 35K05 65Y05 65Y20 PDFBibTeX XMLCite \textit{P. Purcz}, in: Proceedings of the 7th international scientific conference. Section 1: Applied mathematics, Košice, May 22--24, 2002. Košice: Technical University of Košice, Civil Engineering Faculty. 62--68 (2002; Zbl 1031.65099)
Gravvanis, G. A. Explicit approximate inverse preconditioning techniques. (English) Zbl 1032.65046 Arch. Comput. Methods Eng. 9, No. 4, 371-402 (2002). MSC: 65F35 35J65 35K55 65F10 65H10 65M55 65F50 65M06 65M60 65N06 65N30 65N55 35J25 35K20 65Y20 PDFBibTeX XMLCite \textit{G. A. Gravvanis}, Arch. Comput. Methods Eng. 9, No. 4, 371--402 (2002; Zbl 1032.65046) Full Text: DOI
Gennaro, Rosario; Ishai, Yuval; Kushilevitz, Eyal; Rabin, Tal On 2-round secure multiparty computation. (English) Zbl 1026.94527 Yung, Moti (ed.), Advances in cryptology - CRYPTO 2002. 22nd annual international cryptology conference, Santa Barbara, CA, USA, August 18-22, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2442, 178-193 (2002). MSC: 94A60 68Q25 PDFBibTeX XMLCite \textit{R. Gennaro} et al., Lect. Notes Comput. Sci. 2442, 178--193 (2002; Zbl 1026.94527) Full Text: Link
Popov, V. Yu. On the complexity of the word problem for finitely presented commutative semigroups. (Russian, English) Zbl 1019.03031 Sib. Mat. Zh. 43, No. 6, 1339-1349 (2002); translation in Sib. Math. J. 43, No. 6, 1086-1093 (2002). Reviewer: A.S.Morozov (Novosibirsk) MSC: 03D40 20M05 03D15 03D10 20M14 PDFBibTeX XMLCite \textit{V. Yu. Popov}, Sib. Mat. Zh. 43, No. 6, 1339--1349 (2002; Zbl 1019.03031); translation in Sib. Math. J. 43, No. 6, 1086--1093 (2002) Full Text: EuDML EMIS
Korneev, V. G. Local Dirichlet problems on subdomains of decomposition in \(hp\) discretizations, and optimal algorithms for their solution. (English) Zbl 1042.65102 Mat. Model. 14, No. 5, 51-74 (2002). Reviewer: Margit Lenard (Safat) MSC: 65N55 65N30 65Y20 35J25 65F10 65F35 PDFBibTeX XMLCite \textit{V. G. Korneev}, Mat. Model. 14, No. 5, 51--74 (2002; Zbl 1042.65102) Full Text: MNR
Mogensen, Torben Æ. (ed.); Schmidt, David A. (ed.); Sudborough, I. Hal (ed.) The essence of computation. Complexity, analysis, transformation. Essays dedicated to Neil D. Jones. (English) Zbl 1013.00017 Lecture Notes in Computer Science. 2566. Berlin: Springer. xiv, 471 p. (2002). MSC: 00B15 68-06 00B30 68N30 PDFBibTeX XMLCite \textit{T. Æ. Mogensen} (ed.) et al., The essence of computation. Complexity, analysis, transformation. Essays dedicated to Neil D. Jones. Berlin: Springer (2002; Zbl 1013.00017) Full Text: DOI Link
Klíma, Ondčej Unification modulo associativity and idempotency is NP-complete. (English) Zbl 1014.68229 Diks, Krzysztof (ed.) et al., Mathematical foundations of computer science 2002. 27th symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2420, 423-432 (2002). MSC: 68W30 20M05 68Q17 PDFBibTeX XMLCite \textit{O. Klíma}, Lect. Notes Comput. Sci. 2420, 423--432 (2002; Zbl 1014.68229) Full Text: Link
Kára, Jan; Král’, Daniel Optimal free binary decision diagrams for computation of EAR\(_n\). (English) Zbl 1014.68051 Diks, Krzysztof (ed.) et al., Mathematical foundations of computer science 2002. 27th symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2420, 411-422 (2002). MSC: 68P05 68Q05 06E30 68Q25 PDFBibTeX XMLCite \textit{J. Kára} and \textit{D. Král'}, Lect. Notes Comput. Sci. 2420, 411--422 (2002; Zbl 1014.68051) Full Text: Link
Ebert, Todd; Merkle, Wolfgang Autoreducibility of random sets: A sharp bound on the density of guessed bits. (English) Zbl 1014.03046 Diks, Krzysztof (ed.) et al., Mathematical foundations of computer science 2002. 27th symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2420, 221-233 (2002). MSC: 03D30 03D15 PDFBibTeX XMLCite \textit{T. Ebert} and \textit{W. Merkle}, Lect. Notes Comput. Sci. 2420, 221--233 (2002; Zbl 1014.03046) Full Text: Link
Angelsmark, Ola; Dahllöf, Vilhelm; Jonsson, Peter Finite domain constraint satisfaction using quantum computation. (English) Zbl 1014.68217 Diks, Krzysztof (ed.) et al., Mathematical foundations of computer science 2002. 27th symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2420, 93-103 (2002). MSC: 68W05 81P68 68Q25 PDFBibTeX XMLCite \textit{O. Angelsmark} et al., Lect. Notes Comput. Sci. 2420, 93--103 (2002; Zbl 1014.68217) Full Text: Link
Huang, Qinglong An improvement on a modified Newton method. (Chinese. English summary) Zbl 1023.65041 Numer. Math., Nanjing 24, No. 4, 313-319 (2002). MSC: 65H05 65Y20 12Y05 26C10 30C15 PDFBibTeX XMLCite \textit{Q. Huang}, Numer. Math., Nanjing 24, No. 4, 313--319 (2002; Zbl 1023.65041)
Calude, Cristian S. Incompleteness, complexity, randomness and beyond. (English) Zbl 1030.68051 Minds and Machines 12, No. 4, 503-517 (2002). MSC: 68Q30 68Q05 PDFBibTeX XML Full Text: DOI arXiv
Hayes, Thomas P.; Kutin, Samuel; van Melkebeek, Dieter The quantum black-box complexity of majority. (English) Zbl 1012.68073 Algorithmica 34, No. 4, 480-501 (2002). MSC: 68Q10 81P68 PDFBibTeX XMLCite \textit{T. P. Hayes} et al., Algorithmica 34, No. 4, 480--501 (2002; Zbl 1012.68073) Full Text: DOI arXiv
Radhakrishnan, Jaikumar; Sen, Pranab; Venkatesh, S. The quantum complexity of set membership. (English) Zbl 1050.68031 Algorithmica 34, No. 4, 462-479 (2002). MSC: 68P05 81P68 68Q25 PDFBibTeX XMLCite \textit{J. Radhakrishnan} et al., Algorithmica 34, No. 4, 462--479 (2002; Zbl 1050.68031) Full Text: DOI