×

Found 214 Documents (Results 1–100)

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
Full Text: DOI

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
Full Text: DOI

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
Full Text: DOI

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI

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
Full Text: DOI

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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

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).
MSC:  03D65 03D15 68Q15
PDFBibTeX XMLCite

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).
PDFBibTeX XMLCite

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

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

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).
PDFBibTeX XMLCite

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
Full Text: Link

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).
PDFBibTeX XMLCite
Full Text: Link

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
Full Text: Link

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
Full Text: Link

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
Full Text: Link

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
Full Text: Link

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).
PDFBibTeX XMLCite
Full Text: Link

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).
PDFBibTeX XMLCite
Full Text: Link

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).
PDFBibTeX XMLCite
Full Text: Link

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).
PDFBibTeX XMLCite
Full Text: Link

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
Full Text: Link

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
Full Text: Link

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
Full Text: Link

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).
PDFBibTeX XMLCite
Full Text: Link

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
Full Text: Link

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
Full Text: Link

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
Full Text: Link

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

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).
PDFBibTeX XMLCite

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).
PDFBibTeX XMLCite

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).
PDFBibTeX XMLCite
Full Text: Link

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).
PDFBibTeX XMLCite
Full Text: Link

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).
PDFBibTeX XMLCite
Full Text: Link

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).
PDFBibTeX XMLCite

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).
PDFBibTeX XMLCite
Full Text: Link

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).
PDFBibTeX XMLCite
Full Text: Link

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).
PDFBibTeX XMLCite

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
Full Text: Link

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).
PDFBibTeX XMLCite
Full Text: DOI Link

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
Full Text: Link

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
Full Text: Link

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
Full Text: Link

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 3

Main Field

Biographic Reference

all top 3

Software