×

Found 83 Documents (Results 1–83)

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

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

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

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

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

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

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

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

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

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

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).
MSC:  65H05 12Y05 26C10 30C15 65Y20
PDFBibTeX XMLCite

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

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

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).
MSC:  05E35 05E30 94A11 68R05
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 3

Main Field