×

Found 1,954 Documents (Results 1–100)

100
MathJax

Exact real computation of solution operators for linear analytic systems of partial differential equations. (English) Zbl 07497965

Boulier, François (ed.) et al., Computer algebra in scientific computing. 23rd international workshop, CASC 2021, Sochi, Russia, September 13–17, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12865, 370-390 (2021).
MSC:  68W30
PDF BibTeX XML Cite
Full Text: DOI

Algorithms and complexity of \(s\)-club cluster vertex deletion. (English) Zbl 07495020

Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 152-164 (2021).
MSC:  68Rxx 68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Combinatorics and algorithms for quasi-chain graphs. (English) Zbl 07495013

Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 49-62 (2021).
MSC:  68Rxx 68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Computing discrete logarithms. (English) Zbl 1483.94042

Bos, Joppe W. (ed.) et al., Computational cryptography. Algorithmic aspects of cryptology. A tribute to Arjen K. Lenstra on the occasion of his 65th birthday. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 469, 106-139 (2021).
PDF BibTeX XML Cite
Full Text: Link

Sequence graphs: characterization and counting of admissible elements. (English) Zbl 1479.05231

Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 209-221 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Edge tree spanners. (English) Zbl 1479.05052

Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 195-207 (2021).
PDF BibTeX XML Cite
Full Text: DOI

On the geometric red-blue set cover problem. (English) Zbl 07405957

Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 129-141 (2021).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines. (English. Russian original) Zbl 1470.90040

Proc. Steklov Inst. Math. 313, Suppl. 1, S58-S72 (2021); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108-124 (2020).
PDF BibTeX XML Cite
Full Text: DOI

Counting points on superelliptic curves in average polynomial time. (English) Zbl 1472.11322

Galbraith, Steven D. (ed.), ANTS XIV. Proceedings of the fourteenth algorithmic number theory symposium, Auckland, New Zealand, virtual event, June 29 – July 4, 2020. Berkeley, CA: Mathematical Sciences Publishers (MSP). Open Book Ser. 4, 403-422 (2020).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Hypergeometric \(L\)-functions in average polynomial time. (English) Zbl 1472.11316

Galbraith, Steven D. (ed.), ANTS XIV. Proceedings of the fourteenth algorithmic number theory symposium, Auckland, New Zealand, virtual event, June 29 – July 4, 2020. Berkeley, CA: Mathematical Sciences Publishers (MSP). Open Book Ser. 4, 143-159 (2020).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Reconfiguring \(k\)-path vertex covers. (English) Zbl 07224279

Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 14th international conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12049, 133-145 (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Subset feedback vertex set on graphs of bounded independent set size. (English) Zbl 07378606

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 20, 14 p. (2019).
MSC:  68Q25 68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles. (English. Russian original) Zbl 1441.05095

Proc. Steklov Inst. Math. 307, Suppl. 1, S142-S150 (2019); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 24, No. 3, 272-280 (2018).
PDF BibTeX XML Cite
Full Text: DOI

An efficient algorithm for the fast delivery problem. (English) Zbl 1464.68277

Gąsieniec, Leszek Antoni (ed.) et al., Fundamentals of computation theory. 22nd international symposium, FCT 2019, Copenhagen, Denmark, August 12–14, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11651, 171-184 (2019).
PDF BibTeX XML Cite
Full Text: DOI arXiv

\(O(\log^2 k/\log\log k)\)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. (English) Zbl 1433.68614

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 253-264 (2019).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem. (English. Russian original) Zbl 07150939

Comput. Math. Math. Phys. 59, No. 9, 1553-1561 (2019); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 9, 1617-1625 (2019).
MSC:  68Q25 90C20
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software