Showing 81 - 100 of 2,044

81

Polynomials with bounds and numerical approximation
Després, Bruno ; Laboratoire Jacques-Louis Lions (LJLL) ; Université Pierre et Marie Curie - Paris 6 (UPMC)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)
Numerical Algorithms, 2017

polynomials with bounds 4-square Euler identity Polynomial Algorithm [MATH.MATH-NA]Mathematic... Numerical Analysis [math...
Journal
Save to List
82

Computing recursive orthogonal polynomial with Schur complements
Sidki, S. ; Sadaka, R. ; Benazzouz, A.
In Journal of Computational and Applied Mathematics 1 August 2020 373

Academic journal
Save to List
83

Max-Plus Matrix Method for Correctness Verification of Communication Protocols
Wang, Cailu ; Tao, Yuegang ; Tan, Jianguo
In IFAC PapersOnLine 2020 53(4):42-47

Academic journal
Save to List
84

Decomposition of probability marginals for security games in max-flow/min-cut systems
Matuschke, Jannik
ISSN:0025-5610 ; ISSN:1436-4646 ; Mathematical Programming, vol. 210 (1-2.

Science & Technology Technology Physical Sciences Computer Science Software Engineering Operations Research & Ma...
Academic journal
Save to List
85

New and Simple Algorithms for Stable Flow Problems
Cseh, Ágnes ; Matuschke, Jannik ; Cseh, Ágnes ; et al.
Lecture Notes in Computer Science ISBN: 9783319687049

Multicommodity flows FOS: Computer and inform... Technology Discrete Mathematics (cs... Mathematics, Applied Polynomial algorithm
Book
Save to List
86

An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems
Dadush, Daniel ; Koh, Zhuan Khye ; Natura, Bento ; et al.
Mathematics of Operations Research

two variables per inequa... parametric optimization European Union's Horizon... strongly polynomial algo... 0211 other engineering a... submodular function mini...
Academic journal
Save to List
87

Out‐colourings of digraphs
Noga Alon ; Jørgen Bang-Jensen ; Stéphane Bessy
Alon, N, Bang-Jensen, J & Bessy, S 2020, ' Out-colourings of digraphs ', Journal of Graph Theory, vol. 93, no. 1, pp. 88-112 . https://doi.org/10.1002/jgt.22476

out-colourings degree constrained parti... Paley tournament semicomplete digraphs probabilistic method polynomial algorithm
Academic journal
Save to List
88

Better polynomial algorithms for scheduling unit-length jobswith bipartite incompatibility graphs on uniform machines
Marek Kubale ; Tytus Pikies
Bulletin of the Polish Academy of Sciences: Technical Sciences, Vol 67, Iss No. 1, Pp 31-36 (2019)

Technology 4. Education incompatible job polynomial algorithm unit-time job 7. Clean energy
Academic journal
Save to List
89

On the Existence of an Integer Solution of the Relaxed Weber Problem for a Tree Network
Panyukov, A.V.
Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software". 12:150-155

задача Вебера... 0209 industrial biotechn... integer solution allocation problem полиномиальный алгоритм... linear programming
Academic journal
Save to List
90

A Note on Polynomial Algorithm for Cost Coloring of Bipartite Graphs with Δ ≤ 4
Giaro Krzysztof ; Kubale Marek
Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 885-891 (2020)

bipartite graph chromatic sum cost coloring np-completeness polynomial algorithm 05c15
Academic journal
Save to List
91

Approximations for Restrictions of The Budgeted and Generalized Maximum Coverage Problems
Piva, Breno
In Electronic Notes in Theoretical Computer Science 30 August 2019 346:667-676

Academic journal
Save to List
92

A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions
Boros, Endre ; Elbassioni, Khaled ; Gurvich, Vladimir ; et al.
In Information and Computation August 2019 267:74-95

Academic journal
Save to List
93

An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in [formula omitted]
Santiago, CláudioP. ; Assunção Monteiro, Sérgio ; Inácio, Helder ; et al.
In EURO Journal on Computational Optimization June 2019 7(2):177-207

Academic journal
Save to List
94

An [formula omitted] time algorithm for the minimal permutation completion problem
Crespelle, Christophe ; Perez, Anthony ; Todinca, Ioan
In Discrete Applied Mathematics 15 February 2019 254:80-95

Academic journal
Save to List
95

A polynomial recognition of unit forms using graph-based strategies
Alves, Jesmmer ; Castongay, Diane ; Brüstle, Thomas
In Discrete Applied Mathematics 30 January 2019 253:61-72

Academic journal
Save to List
96

Editing to Eulerian graphs
Konrad K. Dabrowski ; Petr A. Golovach ; Pim van 't Hof ; et al.
Leibniz International Proceedings in Informatics
Raman, Venkatesh & Suresh, S. P. (Eds.). (2014). 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Saarbrücken, Germany: Schloss Dagstuhl, pp. 97-108, Leibniz International Proceedings in Informatics (LIPIcs)(29)
Journal of computer and system sciences, 2016, Vol.82(2), pp.213-228 [Peer Reviewed Journal]

FOS: Computer and inform... Discrete Mathematics (cs... Polynomial algorithm 05C85 (Primary) 05C45, 0... VDP::Matematikk og Natur... polynomial algorithm
Academic journal
Save to List
97

Special Type Routing Problems in Plane Graphs
Tatiana Makarovskikh ; Anatoly Panyukov
Mathematics, Vol 10, Iss 795, p 795 (2022)

routing plane graph polynomial algorithm Mathematics QA1-939
Academic journal
Save to List
98

Edge Neighbor Toughness of Graphs
Xin Feng ; Zongtian Wei ; Yucheng Yang
Axioms, Vol 11, Iss 248, p 248 (2022)

graph edge neighbor toughness NP-complete polynomial algorithm tree Mathematics
Academic journal
Save to List
99

Polynomial Asymptotically Optimal Coding of Underdetermined Bernoulli Sources of the General Form
Sholomov, L. A.
Problems of Information Transmission. 56(4):373-387

Academic journal
Save to List
100

Connected max cut is polynomial for graphs without the excluded minor K5\e
Chaourar, Brahim
Journal of Combinatorial Optimization. :1-7

Academic journal
Save to List

Filter