Pan, Victor Y. Univariate polynomials, nearly optimal algorithms for factorization and rootfinding. (English) Zbl 1356.65125 Proceedings of the 2001 international symposium on symbolic and algebraic computation, ISSAC ’01, London, Ontario, Canada, 2001. New York, NY: ACM Press (ISBN 1-58113-417-7). 253-267 (2001). MSC: 65H04 12Y05 65Y05 65Y20 PDFBibTeX XMLCite \textit{V. Y. Pan}, in: Proceedings of the 2001 international symposium on symbolic and algebraic computation, ISSAC '01, London, Ontario, Canada, 2001. New York, NY: ACM Press. 253--267 (2001; Zbl 1356.65125) Full Text: DOI
Blokh, David; Levner, Eugene The maximum traveling salesman problem on banded matrices. (English) Zbl 1320.90068 Int. J. Found. Comput. Sci. 12, No. 6, 809-819 (2001). MSC: 90C27 68Q25 90C35 PDFBibTeX XMLCite \textit{D. Blokh} and \textit{E. Levner}, Int. J. Found. Comput. Sci. 12, No. 6, 809--819 (2001; Zbl 1320.90068) Full Text: DOI
Wei, Shimin; Xiao, Guozhen; Chen, Zhong A fast algorithm for determining the linear complexity of a binary sequence with period \(2^np^m\). (English) Zbl 1125.94319 Sci. China, Ser. F. 44, No. 6, 453-460 (2001). MSC: 94A55 11T71 68P25 68W40 PDFBibTeX XMLCite \textit{S. Wei} et al., Sci. China, Ser. F 44, No. 6, 453--460 (2001; Zbl 1125.94319) Full Text: DOI
van Hoesel, C. P. M.; Wagelmans, A. P. M. Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. (English) Zbl 1082.90532 Math. Oper. Res. 26, No. 2, 339-357 (2001). MSC: 90B35 68Q25 68W25 90B05 90C27 90C60 PDFBibTeX XMLCite \textit{C. P. M. van Hoesel} and \textit{A. P. M. Wagelmans}, Math. Oper. Res. 26, No. 2, 339--357 (2001; Zbl 1082.90532) Full Text: DOI Link
Jansen, Klaus; Porkolab, Lorant Improved approximation schemes for scheduling unrelated parallel machines. (English) Zbl 1082.90525 Math. Oper. Res. 26, No. 2, 324-338 (2001). MSC: 90B35 68Q25 68W40 90C59 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{L. Porkolab}, Math. Oper. Res. 26, No. 2, 324--338 (2001; Zbl 1082.90525) Full Text: DOI
Asano, Tetsuo; Chen, Danny Z.; Katoh, Naoki; Tokuyama, Takeshi Efficient algorithms for optimization-based image segmentation. (English) Zbl 1074.65520 Int. J. Comput. Geom. Appl. 11, No. 2, 145-166 (2001). MSC: 65K10 65Y20 68T45 68U10 PDFBibTeX XMLCite \textit{T. Asano} et al., Int. J. Comput. Geom. Appl. 11, No. 2, 145--166 (2001; Zbl 1074.65520) Full Text: DOI
Gilbert, William J. Generalizations of Newton’s method. (English) Zbl 1046.37027 Fractals 9, No. 3, 251-262 (2001). MSC: 37F10 65J15 PDFBibTeX XMLCite \textit{W. J. Gilbert}, Fractals 9, No. 3, 251--262 (2001; Zbl 1046.37027) Full Text: DOI
Hori, Hideaki; Shimozono, Shinichi; Takeda, Masayuki; Shinohara, Ayumi Fragmentary pattern matching: Complexity, algorithms and applications for analyzing classic literary works. (English) Zbl 1077.68660 Eades, Peter (ed.) et al., Algorithms and computation. 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19–21, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42985-9). Lect. Notes Comput. Sci. 2223, 719-730 (2001). MSC: 68Q25 68W05 68W25 68U15 PDFBibTeX XMLCite \textit{H. Hori} et al., Lect. Notes Comput. Sci. 2223, 719--730 (2001; Zbl 1077.68660) Full Text: Link
Adelson-Velsky, George M.; Gelbukh, Alexander; Levner, Eugene A fast scheduling algorithm in AND-OR graphs. (English) Zbl 1036.90037 Kluev, V. V. (ed.) et al., Topics in applied and theoretical mathematics and computer science. Athens: WSEAS Press (ISBN 960-8052-47-6/hbk). Mathematics and Computers in Science and Engineering. A Series of Reference Books and Textbooks, 170-175 (2001). MSC: 90B35 90C60 90C35 PDFBibTeX XMLCite \textit{G. M. Adelson-Velsky} et al., in: Topics in applied and theoretical mathematics and computer science. Athens: WSEAS Press. 170--175 (2001; Zbl 1036.90037)
Aleksejchuk, A. N. On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials. (English. Russian original) Zbl 1024.06007 Cybern. Syst. Anal. 37, No. 5, 648-653 (2001); translation from Kibern. Sist. Anal. 2001, No. 5, 30-37 (2001). MSC: 06E30 68Q25 94C10 PDFBibTeX XMLCite \textit{A. N. Aleksejchuk}, Cybern. Syst. Anal. 37, No. 5, 648--653 (2001; Zbl 1024.06007); translation from Kibern. Sist. Anal. 2001, No. 5, 30--37 (2001) Full Text: DOI
Barnabei, Marilena; Guerrini, Carla; Montefusco, Laura B. An algebraic framework for biorthogonal M-band filters. (English) Zbl 1021.65072 Trigiante, Donato (ed.), Recent trends in numerical analysis. Dedicated to the 65th birthday of Professor I. Galligani. Huntington, NY: Nova Science Publishers. Adv. Theory Comput. Comput. Math. 3, 17-34 (2001). MSC: 65T60 42C40 PDFBibTeX XMLCite \textit{M. Barnabei} et al., Adv. Theory Comput. Comput. Math. 3, 17--34 (2001; Zbl 1021.65072)
McGuire, Gary An approach to Hensel’s lemma. (English) Zbl 1014.11078 Ir. Math. Soc. Bull. 47, 15-21 (2001). Reviewer: Juan Tena Ayuso (Valladolid) MSC: 11Y16 11C08 13M10 PDFBibTeX XMLCite \textit{G. McGuire}, Ir. Math. Soc. Bull. 47, 15--21 (2001; Zbl 1014.11078)
Bachman, A.; Janiak, A. Scheduling jobs with decreasing processing times for the total completion time minimization. (English) Zbl 1050.90519 Fleischmann, Bernhard (ed.) et al., Operations research proceedings 2000. Selected papers of the symposium, OR 2000, Dresden, Germany, September 9–12, 2000. Berlin: Springer (ISBN 3-540-41587-4). 353-358 (2001). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{A. Bachman} and \textit{A. Janiak}, in: Operations research proceedings 2000. Selected papers of the symposium, OR 2000, Dresden, Germany, September 9--12, 2000. Berlin: Springer. 353--358 (2001; Zbl 1050.90519)
Janiak, A.; Lichtenstein, M. Some single machine scheduling problems with resource dependent set-up and processing times. (English) Zbl 1050.90521 Fleischmann, Bernhard (ed.) et al., Operations research proceedings 2000. Selected papers of the symposium, OR 2000, Dresden, Germany, September 9–12, 2000. Berlin: Springer (ISBN 3-540-41587-4). 60-64 (2001). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{A. Janiak} and \textit{M. Lichtenstein}, in: Operations research proceedings 2000. Selected papers of the symposium, OR 2000, Dresden, Germany, September 9--12, 2000. Berlin: Springer. 60--64 (2001; Zbl 1050.90521)
Gimadi, E. Kh.; Serdyukov, A. I. A problem of finding the maximal spanning connected subgraph with given vertex degrees. (English) Zbl 1050.90563 Fleischmann, Bernhard (ed.) et al., Operations research proceedings 2000. Selected papers of the symposium, OR 2000, Dresden, Germany, September 9–12, 2000. Berlin: Springer (ISBN 3-540-41587-4). 55-59 (2001). MSC: 90C35 05C85 90C59 90C60 68W25 PDFBibTeX XMLCite \textit{E. Kh. Gimadi} and \textit{A. I. Serdyukov}, in: Operations research proceedings 2000. Selected papers of the symposium, OR 2000, Dresden, Germany, September 9--12, 2000. Berlin: Springer. 55--59 (2001; Zbl 1050.90563)
Fomin, S. A. New approximate algorithm for solving a positive linear programming problem. (Russian) Zbl 1025.90008 Diskretn. Anal. Issled. Oper., Ser. 2 8, No. 2, 52-72 (2001). MSC: 90C05 90C08 90C59 90C60 PDFBibTeX XMLCite \textit{S. A. Fomin}, Diskretn. Anal. Issled. Oper., Ser. 2 8, No. 2, 52--72 (2001; Zbl 1025.90008)
Beigel, Richard; Chang, Richard Commutative queries. (English) Zbl 1007.03040 Inf. Comput. 166, No. 1, 71-91 (2001). MSC: 03D15 68Q15 03D10 03B25 PDFBibTeX XMLCite \textit{R. Beigel} and \textit{R. Chang}, Inf. Comput. 166, No. 1, 71--91 (2001; Zbl 1007.03040) Full Text: DOI
Nickelsen, Arfst; Tantau, Till Closure of polynomial time partial information classes under polynomial time reduction. (English) Zbl 1005.68074 Freivalds, Rūsiņš (ed.), Fundamentals of computation theory. 13th international symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2138, 299-310 (2001). MSC: 68Q15 PDFBibTeX XMLCite \textit{A. Nickelsen} and \textit{T. Tantau}, Lect. Notes Comput. Sci. 2138, 299--310 (2001; Zbl 1005.68074)
Mastrolilli, Monaldo Combining arithmetic and geometric rounding techniques for knapsack problems. (English) Zbl 1003.90034 Freivalds, Rūsiņš (ed.), Fundamentals of computation theory. 13th international symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2138, 525-534 (2001). MSC: 90C27 90C60 90C59 PDFBibTeX XMLCite \textit{M. Mastrolilli}, Lect. Notes Comput. Sci. 2138, 525--534 (2001; Zbl 1003.90034) Full Text: Link
Baier, Harald Efficient computation of singular moduli with application in cryptography. (English) Zbl 1001.11057 Freivalds, Rūsiņš (ed.), Fundamentals of computation theory. 13th international symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2138, 71-82 (2001). MSC: 11Y16 94A60 11T71 PDFBibTeX XMLCite \textit{H. Baier}, Lect. Notes Comput. Sci. 2138, 71--82 (2001; Zbl 1001.11057) Full Text: Link
Lee, M.-S.; Lim, J.-T. On optimal supervisory control with trimness of controlled systems. (English) Zbl 1032.93047 Int. J. Syst. Sci. 32, No. 5, 661-667 (2001). Reviewer: T.Riismaa (Tallinn) MSC: 93C65 93A13 68Q25 93A14 PDFBibTeX XMLCite \textit{M. S. Lee} and \textit{J. T. Lim}, Int. J. Syst. Sci. 32, No. 5, 661--667 (2001; Zbl 1032.93047) Full Text: DOI
Jarnicki, Witold; O’Carroll, Liam; Winiarski, Tadeusz Ideal as an intersection of zero-dimensional ideals and the Noether exponent. (English) Zbl 1007.13008 Zesz. Nauk. Uniw. Jagiell. 1255, Univ. Iagell. Acta Math. 39, 139-146 (2001). Reviewer: Luca Chiantini (Siena) MSC: 13F20 14Q20 14M10 PDFBibTeX XMLCite \textit{W. Jarnicki} et al., Zesz. Nauk. Uniw. Jagiell., Univ. Iagell. Acta Math. 1255(39), 139--146 (2001; Zbl 1007.13008) Full Text: EuDML
Díaz, Josep; Serna, Maria; Thilikos, Dimitrios M. Counting \(H\)-colorings of partial \(k\)-trees. (English) Zbl 0993.05135 Wang, Jie (ed.), Computing and combinatorics. 7th annual international conference, COCOON 2001, Guilin, China, August 20-23, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2108, 298-307 (2001). MSC: 05C85 68Q25 05C15 68R10 PDFBibTeX XMLCite \textit{J. Díaz} et al., Lect. Notes Comput. Sci. 2108, 298--307 (2001; Zbl 0993.05135) Full Text: Link
He, Shanglu; Xu, Chengxian Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity. (English) Zbl 1002.90071 Sci. China, Ser. A 44, No. 3, 338-344 (2001). MSC: 90C33 90C51 90C60 PDFBibTeX XMLCite \textit{S. He} and \textit{C. Xu}, Sci. China, Ser. A 44, No. 3, 338--344 (2001; Zbl 1002.90071) Full Text: DOI
Shi, Hailin Study on the polynomial-time algorithms of NP complete problems. (Chinese. English summary) Zbl 1008.90050 Math. Appl. 14, Suppl., 107-112 (2001). MSC: 90C27 68Q15 05C85 PDFBibTeX XMLCite \textit{H. Shi}, Math. Appl. 14, 107--112 (2001; Zbl 1008.90050)
Meidl, Wilfried; Winterhof, Arne Lower bounds on the linear complexity of the discrete logarithm in finite fields. (English) Zbl 1032.94004 IEEE Trans. Inf. Theory 47, No. 7, 2807-2811 (2001). MSC: 94A55 11T71 94A60 68P25 PDFBibTeX XMLCite \textit{W. Meidl} and \textit{A. Winterhof}, IEEE Trans. Inf. Theory 47, No. 7, 2807--2811 (2001; Zbl 1032.94004) Full Text: DOI
Green, Frederic; Pruim, Randall Relativized separation of EQP from \(\text{P}^{\text{NP}}\). (English) Zbl 1003.68053 Inf. Process. Lett. 80, No. 5, 257-260 (2001). MSC: 68Q15 81P68 68Q05 PDFBibTeX XMLCite \textit{F. Green} and \textit{R. Pruim}, Inf. Process. Lett. 80, No. 5, 257--260 (2001; Zbl 1003.68053) Full Text: DOI
Boros, E.; Elbassioni, K.; Gurvich, V.; Khachiyan, L.; Makino, K. On generating all minimal integer solutions for a monotone system of linear inequalities. (English) Zbl 0986.90024 Orejas, Fernando (ed.) et al., Automata, languages and programming. 28th international colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2076, 92-103 (2001). MSC: 90C10 90C60 PDFBibTeX XMLCite \textit{E. Boros} et al., Lect. Notes Comput. Sci. 2076, 92--103 (2001; Zbl 0986.90024) Full Text: Link
D’Andrea, Carlos; Emiris, Ioannis Z. Computing sparse projection operators. (English) Zbl 1013.14017 Green, Edward L. (ed.) et al., Symbolic computation: Solving equations in algebra, geometry, and engineering. Proceedings of an AMS-IMS-SIAM joint summer research conference, Mount Holyoke College, South Hadley, MA, USA, June 11-15, 2000. Providence, RI: AMS, American Mathematical Society. Contemp. Math. 286, 121-139 (2001). Reviewer: Mihai Cipu (Bucureşti) MSC: 14Q99 68Q25 13P99 68W30 PDFBibTeX XMLCite \textit{C. D'Andrea} and \textit{I. Z. Emiris}, Contemp. Math. 286, 121--139 (2001; Zbl 1013.14017)
Kuznetsov, Sergei O. On computing the size of a lattice and related decision problems. (English) Zbl 0991.06006 Order 18, No. 4, 313-321 (2001). Reviewer: Václav Koubek (Praha) MSC: 06B99 68Q25 68Q17 06A15 PDFBibTeX XMLCite \textit{S. O. Kuznetsov}, Order 18, No. 4, 313--321 (2001; Zbl 0991.06006) Full Text: DOI
Yang, Chao; Liu, Jinglin A capacity expansion problem with budget constraint and bottleneck limitation. (English) Zbl 1016.90025 Acta Math. Sci., Ser. B, Engl. Ed. 21, No. 3, 428-432 (2001). MSC: 90C08 90C60 90C27 52A20 52B12 65K05 PDFBibTeX XMLCite \textit{C. Yang} and \textit{J. Liu}, Acta Math. Sci., Ser. B, Engl. Ed. 21, No. 3, 428--432 (2001; Zbl 1016.90025) Full Text: DOI
Fenner, S.; Homer, S.; Pruim, R.; Schaefer, M. Hyper-polynomial hierarchies and the polynomial jump. (English) Zbl 0983.68075 Theor. Comput. Sci. 262, No. 1-2, 241-256 (2001). MSC: 68Q15 PDFBibTeX XMLCite \textit{S. Fenner} et al., Theor. Comput. Sci. 262, No. 1--2, 241--256 (2001; Zbl 0983.68075) Full Text: DOI
DasGupta, B.; Sontag, E. D. A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems. (English) Zbl 0983.68078 Theor. Comput. Sci. 262, No. 1-2, 161-189 (2001). MSC: 68Q25 PDFBibTeX XMLCite \textit{B. DasGupta} and \textit{E. D. Sontag}, Theor. Comput. Sci. 262, No. 1--2, 161--189 (2001; Zbl 0983.68078) Full Text: DOI
Lee, D.; Woźniakowski, H. Approximate evaluations of characteristic polynomials of Boolean functions. (English) Zbl 1012.94026 Theor. Comput. Sci. 262, No. 1-2, 37-68 (2001). Reviewer: A.Michalski (Warszawa) MSC: 94C10 94C12 PDFBibTeX XMLCite \textit{D. Lee} and \textit{H. Woźniakowski}, Theor. Comput. Sci. 262, No. 1--2, 37--68 (2001; Zbl 1012.94026) Full Text: DOI
Cheng, Lizhi; Jiang, Zengrong An efficient algorithm for cyclic convolution based on fast-polynomial and fast-\(W\) transforms. (English) Zbl 0994.65151 Circuits Syst. Signal Process. 20, No. 1, 77-88 (2001). Reviewer: Manfred Tasche (Rostock) MSC: 65T50 94A12 PDFBibTeX XMLCite \textit{L. Cheng} and \textit{Z. Jiang}, Circuits Syst. Signal Process. 20, No. 1, 77--88 (2001; Zbl 0994.65151) Full Text: DOI
Chiu, Andrew; Davida, George; Litow, Bruce Division in logspace-uniform NC. (English) Zbl 1014.68062 Theor. Inform. Appl. 35, No. 3, 259-275 (2001). MSC: 68Q05 68Q10 68Q15 68Q17 PDFBibTeX XMLCite \textit{A. Chiu} et al., Theor. Inform. Appl. 35, No. 3, 259--275 (2001; Zbl 1014.68062) Full Text: DOI Numdam EuDML
Krajíček, Jan On the degree of ideal membership proofs from uniform families of polynomials over a finite field. (English) Zbl 0984.03044 Ill. J. Math. 45, No. 1, 41-73 (2001). MSC: 03F20 12L12 12E12 68Q15 13L05 PDFBibTeX XMLCite \textit{J. Krajíček}, Ill. J. Math. 45, No. 1, 41--73 (2001; Zbl 0984.03044)
Engels, Daniel W.; Feldman, Jon; Karger, David R.; Ruhl, Matthias Parallel processor scheduling with delay constraints. (English) Zbl 1018.90014 Kosaraju, Deborah, Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms. Washington, DC, USA, January 7-9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. 577-585 (2001). MSC: 90B35 65Y20 PDFBibTeX XMLCite \textit{D. W. Engels} et al., in: Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms, SODA 2001, Washington, DC, USA, January 7--9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics; New York, NY: ACM, Association for Computing Machinery. 577--585 (2001; Zbl 1018.90014)
Petković, M. S.; Petković, L.; Živković, D. Laguerre-like methods for the simultaneous approximation of polynomial zeros. (English) Zbl 1002.65057 Alefeld, G. (ed.) et al., Topics in numerical analysis. With special emphasis on nonlinear problems. Dedicated to Prof. Tetsuro Yamamoto on his 65th birthday. Wien: Springer. Comput. Suppl. 15, 189-209 (2001). Reviewer: Matthew He (Ft.Lauderdale) MSC: 65H05 12Y05 26C10 30C15 65Y20 PDFBibTeX XMLCite \textit{M. S. Petković} et al., Comput. Suppl. 15, 189--209 (2001; Zbl 1002.65057)
Bourgade, Ménard Separations and transfers in the polynomial hierarchy of infinite abelian groups. (Séparations et transferts dans la hiérarchie polynomiale des groupes abéliens infinis.) (French) Zbl 0989.03032 Math. Log. Q. 47, No. 4, 493-502 (2001). MSC: 03C10 03D15 68Q15 68Q05 PDFBibTeX XMLCite \textit{M. Bourgade}, Math. Log. Q. 47, No. 4, 493--502 (2001; Zbl 0989.03032) Full Text: DOI
Halupczok, Karin On algebraic complexity of polynomials and their multiples. (Zur algebraischen Komplexität von Polynomen und ihren Vielfachen.) (German) Zbl 0998.65030 Konstanz: Hartung-Gorre. Konstanz: Univ. Konstanz (Diss.), iv, 64 S. (2001). MSC: 65D20 12Y05 68Q25 PDFBibTeX XMLCite \textit{K. Halupczok}, Zur algebraischen Komplexität von Polynomen und ihren Vielfachen. Konstanz: Hartung-Gorre; Konstanz: Univ. Konstanz (Diss.) (2001; Zbl 0998.65030)
Wu, Huapeng On complexity of polynomial basis squaring in \(\mathbb{F}_{2^m}\). (English) Zbl 0992.94514 Stinson, Douglas R. (ed.) et al., Selected areas in cryptography. 7th annual international workshop, SAC 2000, Waterloo, Ontario, Canada, August 14-15, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2012, 118-129 (2001). MSC: 94A60 11T71 68Q25 PDFBibTeX XMLCite \textit{H. Wu}, Lect. Notes Comput. Sci. 2012, 118--129 (2001; Zbl 0992.94514)
de Figueiredo, Celina M. H.; Vušković, Kristina Recognition of quasi-Meyniel graphs. (English) Zbl 1001.68089 Discrete Appl. Math. 113, No. 2-3, 255-260 (2001). MSC: 68R10 05C17 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{C. M. H. de Figueiredo} and \textit{K. Vušković}, Discrete Appl. Math. 113, No. 2--3, 255--260 (2001; Zbl 1001.68089) Full Text: DOI
Sims, Charles C. On the complexity of the endomorphism problem for free groups. (English) Zbl 1052.20020 Kantor, William M. (ed.) et al., Groups and computation III. Proceedings of the international conference at the Ohio State University, Columbus, OH, USA, June 15–19, 1999. Berlin: Walter de Gruyter (ISBN 3-11-016721-2/hbk). Ohio State Univ. Math. Res. Inst. Publ. 8, 349-360 (2001). MSC: 20E05 20F10 20-04 20E36 68W30 68Q25 PDFBibTeX XMLCite \textit{C. C. Sims}, Ohio State Univ. Math. Res. Inst. Publ. 8, 349--360 (2001; Zbl 1052.20020)
Babai, László; Shalev, Aner Recognizing simplicity of black-box groups and the frequency of \(p\)-singular elements in affine groups. (English) Zbl 1052.20031 Kantor, William M. (ed.) et al., Groups and computation III. Proceedings of the international conference at the Ohio State University, Columbus, OH, USA, June 15–19, 1999. Berlin: Walter de Gruyter (ISBN 3-11-016721-2/hbk). Ohio State Univ. Math. Res. Inst. Publ. 8, 39-62 (2001). MSC: 20G40 20D06 68W30 PDFBibTeX XMLCite \textit{L. Babai} and \textit{A. Shalev}, Ohio State Univ. Math. Res. Inst. Publ. 8, 39--62 (2001; Zbl 1052.20031)
Cutkosky, Steven Dale; Ein, Lawrence; Lazarsfeld, Robert Positivity and complexity of ideal sheaves. (English) Zbl 1029.14022 Math. Ann. 321, No. 2, 213-234 (2001). Reviewer: T.G.Berry (Caracas) MSC: 14Q99 68W30 68Q25 14F05 14F17 PDFBibTeX XMLCite \textit{S. D. Cutkosky} et al., Math. Ann. 321, No. 2, 213--234 (2001; Zbl 1029.14022) Full Text: DOI arXiv
Zukerman, Moshe; Jia, Long; Neame, Timothy; Woeginger, Gerhard J. A polynomially solvable special case of the unbounded knapsack problem. (English) Zbl 0981.90062 Oper. Res. Lett. 29, No. 1, 13-16 (2001). MSC: 90C57 90C10 65Y20 PDFBibTeX XMLCite \textit{M. Zukerman} et al., Oper. Res. Lett. 29, No. 1, 13--16 (2001; Zbl 0981.90062) Full Text: DOI
Peng, J.; Roos, C.; Terlaky, T. New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction. (English) Zbl 1009.90081 J. Optimization Theory Appl. 109, No. 2, 327-343 (2001). Reviewer: Srinivas Raghava Mohan (New Delhi) MSC: 90C22 90C60 90C51 PDFBibTeX XMLCite \textit{J. Peng} et al., J. Optim. Theory Appl. 109, No. 2, 327--343 (2001; Zbl 1009.90081) Full Text: DOI
Onn, Shmuel; Schulman, Leonard J. The vector partition problem for convex objective functions. (English) Zbl 1073.90535 Math. Oper. Res. 26, No. 3, 583-590 (2001). MSC: 90C25 05A18 52A41 68Q25 90C27 PDFBibTeX XMLCite \textit{S. Onn} and \textit{L. J. Schulman}, Math. Oper. Res. 26, No. 3, 583--590 (2001; Zbl 1073.90535) Full Text: DOI Link
McCormick, S. Thomas; Smallwood, Scott R.; Spieksma, Frits C. R. A polynomial algorithm for multiprocessor scheduling with two job lengths. (English) Zbl 1073.90513 Math. Oper. Res. 26, No. 1, 31-49 (2001). MSC: 90B35 68Q17 90C60 PDFBibTeX XMLCite \textit{S. T. McCormick} et al., Math. Oper. Res. 26, No. 1, 31--49 (2001; Zbl 1073.90513) Full Text: DOI
Malajovich, Gregorio; Zubelli, Jorge P. On the geometry of Graeffe iteration. (English) Zbl 0994.65055 J. Complexity 17, No. 3, 541-573 (2001). Reviewer: Vasile Berinde (Baia Mare) MSC: 65H05 12Y05 30C15 65Y20 PDFBibTeX XMLCite \textit{G. Malajovich} and \textit{J. P. Zubelli}, J. Complexity 17, No. 3, 541--573 (2001; Zbl 0994.65055) Full Text: DOI arXiv
Pan, V. Y. A new proximity test for polynomial zeros. (English) Zbl 0984.65045 Comput. Math. Appl. 41, No. 12, 1559-1560 (2001). MSC: 65H05 12Y05 30C15 65Y20 PDFBibTeX XMLCite \textit{V. Y. Pan}, Comput. Math. Appl. 41, No. 12, 1559--1560 (2001; Zbl 0984.65045) Full Text: DOI
Vidyasagar, M.; Blondel, Vincent D. Probabilistic solutions to some NP-hard matrix problems. (English) Zbl 1031.93165 Automatica 37, No. 9, 1397-1405 (2001). Reviewer: R.Buckdahn (Brest) MSC: 93E25 65Y20 93B35 68T05 93B40 93D09 93D15 68Q17 68W20 PDFBibTeX XMLCite \textit{M. Vidyasagar} and \textit{V. D. Blondel}, Automatica 37, No. 9, 1397--1405 (2001; Zbl 1031.93165) Full Text: DOI
Balyuk, A. S.; Vinokurov, S. F.; Gaĭdukov, A. I.; Zubkov, O. V.; Kirichenko, K. D.; Panteleev, V. I.; Peryazev, N. A.; Peryazeva, Yu. V. Vinokurov, S. F. (ed.); Peryazev, N. A. (ed.) Selected problems in the theory of Boolean functions. Ed. by S. F. Vinokurov and N. A. Peryazev. (Избранные вопросы теории Булевых функций.) (Russian) Zbl 0979.06001 Moskva: FIZMATLIT. 191 p. (2001). Reviewer: Sergiu Rudeanu (Bucureşti) MSC: 06-02 06E30 94D10 68Q25 94-02 PDFBibTeX XMLCite \textit{A. S. Balyuk} et al., Избранные вопросы теории Булевых функций (Russian). Moskva: FIZMATLIT (2001; Zbl 0979.06001)
Tunçel, Levent Generalization of primal-dual interior-point methods to convex optimization problems in conic form. (English) Zbl 1017.90126 Found. Comput. Math. 1, No. 3, 229-254 (2001). MSC: 90C51 65K05 90C25 PDFBibTeX XMLCite \textit{L. Tunçel}, Found. Comput. Math. 1, No. 3, 229--254 (2001; Zbl 1017.90126)
Downey, Rod G.; Fellows, Michael R. Index sets and parametric reductions. (English) Zbl 0989.03038 Arch. Math. Logic 40, No. 5, 329-348 (2001). Reviewer: Marius Zimand (Towson) MSC: 03D15 03D30 68Q15 PDFBibTeX XMLCite \textit{R. G. Downey} and \textit{M. R. Fellows}, Arch. Math. Logic 40, No. 5, 329--348 (2001; Zbl 0989.03038) Full Text: DOI
Blass, Andreas; Gurevich, Yuri; Shelah, Saharon Addendum to “Choiceless polynomial time”. (English) Zbl 0984.03506 Ann. Pure Appl. Logic 112, No. 1, 117 (2001). MSC: 03D10 68Q15 03D15 68Q10 68Q05 68Q19 03C13 PDFBibTeX XMLCite \textit{A. Blass} et al., Ann. Pure Appl. Logic 112, No. 1, 117 (2001; Zbl 0984.03506) Full Text: DOI
Lorenz, Dean H.; Raz, Danny A simple efficient approximation scheme for the restricted shortest path problem. (English) Zbl 0992.90057 Oper. Res. Lett. 28, No. 5, 213-219 (2001). MSC: 90C27 90C59 90C35 90C60 68W25 PDFBibTeX XMLCite \textit{D. H. Lorenz} and \textit{D. Raz}, Oper. Res. Lett. 28, No. 5, 213--219 (2001; Zbl 0992.90057) Full Text: DOI
Flajolet, P.; Gourdon, X.; Panario, D. The complete analysis of a polynomial factorization algorithm over finite fields. (English) Zbl 1024.11079 J. Algorithms 40, No. 1, 37-81 (2001). Reviewer: Juan Sabia (Buenos Aires) MSC: 11Y16 11T06 12Y05 68W05 PDFBibTeX XMLCite \textit{P. Flajolet} et al., J. Algorithms 40, No. 1, 37--81 (2001; Zbl 1024.11079) Full Text: DOI Link
Buss, Sam; Grigoriev, Dima; Impagliazzo, Russell; Pitassi, Toniann Linear gaps between degrees for the polynomial calculus modulo distinct primes. (English) Zbl 1007.03052 J. Comput. Syst. Sci. 62, No. 2, 267-289 (2001). MSC: 03F20 68Q17 68Q25 68W30 PDFBibTeX XMLCite \textit{S. Buss} et al., J. Comput. Syst. Sci. 62, No. 2, 267--289 (2001; Zbl 1007.03052) Full Text: DOI
Rojas, J. Maurice Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy. (English) Zbl 0989.65033 J. Comput. Syst. Sci. 62, No. 2, 216-235 (2001). Reviewer: Dana Petcu (Timişoara) MSC: 65D18 68Q17 68Q25 68U05 PDFBibTeX XMLCite \textit{J. M. Rojas}, J. Comput. Syst. Sci. 62, No. 2, 216--235 (2001; Zbl 0989.65033) Full Text: DOI arXiv
Novak, Erich; Woźniakowski, Henryk When are integration and discrepancy tractable? (English) Zbl 0978.65014 DeVore, Ronald A. (ed.) et al., Foundations of computational mathematics. Conference, Oxford, GB, July 18-28, 1999. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 284, 211-266 (2001). MSC: 65D32 41A55 41A63 65Y20 PDFBibTeX XMLCite \textit{E. Novak} and \textit{H. Woźniakowski}, Lond. Math. Soc. Lect. Note Ser. 284, 211--266 (2001; Zbl 0978.65014)
Giusti, Marc; Heintz, Joos Kronecker’s smart, little black boxes. (English) Zbl 0978.65043 DeVore, Ronald A. (ed.) et al., Foundations of computational mathematics. Conference, Oxford, GB, July 18-28, 1999. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 284, 69-104 (2001). MSC: 65H10 12Y05 30C15 26C10 65Y20 PDFBibTeX XMLCite \textit{M. Giusti} and \textit{J. Heintz}, Lond. Math. Soc. Lect. Note Ser. 284, 69--104 (2001; Zbl 0978.65043)
Reith, S.; Wagner, K. W. On boolean lowness and boolean highness. (English) Zbl 0974.68064 Theor. Comput. Sci. 261, No. 2, 305-321 (2001). MSC: 68Q15 03D15 PDFBibTeX XMLCite \textit{S. Reith} and \textit{K. W. Wagner}, Theor. Comput. Sci. 261, No. 2, 305--321 (2001; Zbl 0974.68064) Full Text: DOI
Aldaz, M.; Matera, G.; Montaña, J. L.; Pardo, Luis M. A new method to obtain lower bounds for polynomial evaluation. (English) Zbl 0972.68089 Theor. Comput. Sci. 259, No. 1-2, 577-596 (2001). MSC: 68Q15 PDFBibTeX XMLCite \textit{M. Aldaz} et al., Theor. Comput. Sci. 259, No. 1--2, 577--596 (2001; Zbl 0972.68089) Full Text: DOI
Verma, Rakesh M.; Rusinowitch, Michael; Lugiez, Denis Algorithms and reductions for rewriting problems. (English) Zbl 0989.03036 Fundam. Inform. 46, No. 3, 257-276 (2001). Reviewer: Marius Zimand (Towson) MSC: 03D03 68Q42 03B25 03D35 03D15 03D40 PDFBibTeX XMLCite \textit{R. M. Verma} et al., Fundam. Inform. 46, No. 3, 257--276 (2001; Zbl 0989.03036)
Buss, Samuel R.; Pudlák, Pavel On the computational content of intuitionistic propositional proofs. (English) Zbl 1009.03027 Ann. Pure Appl. Logic 109, No. 1-2, 49-64 (2001). Reviewer: Anton Setzer (Swansea) MSC: 03F20 03F05 03F07 03D15 68Q17 03D10 03B20 68Q15 PDFBibTeX XMLCite \textit{S. R. Buss} and \textit{P. Pudlák}, Ann. Pure Appl. Logic 109, No. 1--2, 49--64 (2001; Zbl 1009.03027) Full Text: DOI
Alekhnovich, Michael; Buss, Sam; Moran, Shlomo; Pitassi, Toniann Minimum propositional proof length is NP-hard to linearly approximate. (English) Zbl 0977.03032 J. Symb. Log. 66, No. 1, 171-191 (2001). MSC: 03F20 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Alekhnovich} et al., J. Symb. Log. 66, No. 1, 171--191 (2001; Zbl 0977.03032) Full Text: DOI
Riis, Søren; Sitharam, Meera Uniformly generated submodules of permutation modules over fields of characteristic 0. (English) Zbl 1065.20018 J. Pure Appl. Algebra 160, No. 2-3, 285-318 (2001). MSC: 20C30 05E10 03F20 68Q15 PDFBibTeX XMLCite \textit{S. Riis} and \textit{M. Sitharam}, J. Pure Appl. Algebra 160, No. 2--3, 285--318 (2001; Zbl 1065.20018) Full Text: DOI
Giusti, Marc; Lecerf, Grégoire; Salvy, Bruno A Gröbner free alternative for polynomial system solving. (English) Zbl 1003.12005 J. Complexity 17, No. 1, 154-211 (2001). Reviewer: Francis John Wright (London) MSC: 12Y05 68W30 13P10 14Q99 68W40 PDFBibTeX XMLCite \textit{M. Giusti} et al., J. Complexity 17, No. 1, 154--211 (2001; Zbl 1003.12005) Full Text: DOI
Kashirskikh, K. H.; Kononov, A. V.; Sevast’yanov, S. V.; Chernykh, I. D. A polynomially solvable case of the two-stage open shop problem for three machines. (Russian) Zbl 0970.90029 Diskretn. Anal. Issled. Oper., Ser. 1 8, No. 1, 23-39 (2001). Reviewer: V.Grebenev (Novosibirsk) MSC: 90B35 68M20 90C60 PDFBibTeX XMLCite \textit{K. H. Kashirskikh} et al., Diskretn. Anal. Issled. Oper., Ser. 1 8, No. 1, 23--39 (2001; Zbl 0970.90029)
Vidras, Alekos; Yger, Alain On some generalizations of Jacobi’s residue formula. (English) Zbl 0991.32003 Ann. Sci. Éc. Norm. Supér. (4) 34, No. 1, 131-157 (2001). Reviewer: Aleksandr G.Aleksandrov (Moskva) MSC: 32A27 32A25 32C30 13F20 14M25 14Q20 PDFBibTeX XMLCite \textit{A. Vidras} and \textit{A. Yger}, Ann. Sci. Éc. Norm. Supér. (4) 34, No. 1, 131--157 (2001; Zbl 0991.32003) Full Text: DOI arXiv Numdam EuDML
Fleischer, Lisa K. Faster algorithms for the quickest transshipment problem. (English) Zbl 0992.68071 SIAM J. Optim. 12, No. 1, 18-35 (2001). MSC: 68Q25 90C27 90C35 90C08 PDFBibTeX XMLCite \textit{L. K. Fleischer}, SIAM J. Optim. 12, No. 1, 18--35 (2001; Zbl 0992.68071) Full Text: DOI
Althaus, Ernst; Mehlhorn, Kurt Traveling salesman-based curve reconstruction in polynomial time. (English) Zbl 0992.68070 SIAM J. Comput. 31, No. 1, 27-66 (2001). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{E. Althaus} and \textit{K. Mehlhorn}, SIAM J. Comput. 31, No. 1, 27--66 (2001; Zbl 0992.68070) Full Text: DOI
Chen, Jianer; Miranda, Antonio A polynomial time approximation scheme for general multiprocessor job scheduling. (English) Zbl 0992.68009 SIAM J. Comput. 31, No. 1, 1-17 (2001). MSC: 68M20 90B35 90C27 90C39 68Q25 68W05 PDFBibTeX XMLCite \textit{J. Chen} and \textit{A. Miranda}, SIAM J. Comput. 31, No. 1, 1--17 (2001; Zbl 0992.68009) Full Text: DOI
Boros, Endre; Gurvich, Vladimir; Khachiyan, Leonid; Makino, Kazuhisa Dual-bounded generating problems: Partial and multiple transversals of a hypergraph. (English) Zbl 0980.68077 SIAM J. Comput. 30, No. 6, 2036-2050 (2001). MSC: 68R05 68Q32 68Q25 PDFBibTeX XMLCite \textit{E. Boros} et al., SIAM J. Comput. 30, No. 6, 2036--2050 (2001; Zbl 0980.68077) Full Text: DOI
Jiang, Tao; Kearney, Paul; Li, Ming A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. (English) Zbl 0980.68055 SIAM J. Comput. 30, No. 6, 1942-1961 (2001). MSC: 68Q25 92B99 PDFBibTeX XMLCite \textit{T. Jiang} et al., SIAM J. Comput. 30, No. 6, 1942--1961 (2001; Zbl 0980.68055) Full Text: DOI
Tamm, Ulrich Communication complexity and orthogonal polynomials. (English) Zbl 0969.05070 Barg, Alexander (ed.) et al., Codes and association schemes. DIMACS workshop, DIMACS Center, Princeton, NJ, USA, November 9-12, 1999. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 56, 277-285 (2001). Reviewer: Alexandre A.Makhnev (Ekaterinburg) MSC: 05E35 05E30 94A11 68R05 PDFBibTeX XMLCite \textit{U. Tamm}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 56, 277--285 (2001; Zbl 0969.05070)
Potts, C. N.; Strusevich, V. A.; Tautenhahn, T. Scheduling batches with simultaneous job processing for two-machine shop problems. (English) Zbl 0979.90117 J. Sched. 4, No. 1, 25-51 (2001). MSC: 90C35 90C27 65Y20 PDFBibTeX XMLCite \textit{C. N. Potts} et al., J. Sched. 4, No. 1, 25--51 (2001; Zbl 0979.90117) Full Text: DOI
Terlaky, Tamaś An easy way to teach interior-point methods. (English) Zbl 1068.90614 Eur. J. Oper. Res. 130, No. 1, 1-19 (2001). MSC: 90C51 90C05 PDFBibTeX XMLCite \textit{T. Terlaky}, Eur. J. Oper. Res. 130, No. 1, 1--19 (2001; Zbl 1068.90614) Full Text: DOI
Gao, Shuhong On the deterministic complexity of factoring polynomials. (English) Zbl 0972.11113 J. Symb. Comput. 31, No. 1-2, 19-36 (2001). Reviewer: Maurice Mignotte (Strasbourg) MSC: 11Y16 11T06 68W30 PDFBibTeX XMLCite \textit{S. Gao}, J. Symb. Comput. 31, No. 1--2, 19--36 (2001; Zbl 0972.11113) Full Text: DOI Link
Codenotti, B.; Resta, G. On the permanent of certain circulant matrices. (English) Zbl 0968.65027 Crapo, H. (ed.) et al., Algebraic combinatorics and computer science. A tribute to Gian-Carlo Rota. Milano: Springer. 513-532 (2001). MSC: 65F40 15A15 05C50 65Y20 PDFBibTeX XMLCite \textit{B. Codenotti} and \textit{G. Resta}, in: Algebraic combinatorics and computer science. A tribute to Gian-Carlo Rota. Milano: Springer. 513--532 (2001; Zbl 0968.65027)
Jȩdrzejowicz, J.; Szepietowski, A. Shuffle languages are in P. (English) Zbl 0952.68079 Theor. Comput. Sci. 250, No. 1-2, 31-53 (2001). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Jȩdrzejowicz} and \textit{A. Szepietowski}, Theor. Comput. Sci. 250, No. 1--2, 31--53 (2001; Zbl 0952.68079) Full Text: DOI