Search Results - "Polynomial time algorithm"
-
1
Authors: et al.
Source: Scientific Reports, Vol 15, Iss 1, Pp 1-18 (2025)
Subject Terms: Intelligent manufacturing system, Industrial automation, Reliable supply chain management, Adversary model, Probability polynomial time algorithm, Medicine, Science
File Description: electronic resource
Relation: https://doaj.org/toc/2045-2322
-
2
Authors: Muhammad Tlas
Source: Network Biology, Vol 15, Iss 2, Pp 48-66 (2025)
Subject Terms: maximum flow problem, scaling algorithm, polynomial time algorithm, augmenting path method, network flow, digraph, Biology (General), QH301-705.5
File Description: electronic resource
Relation: http://www.iaees.org/publications/journals/nb/articles/2025-15(2)/a-bit-arc-capacity-scaling-algorithm.pdf; https://doaj.org/toc/2220-8879
-
3
Authors:
Source: Journal of Scheduling. 27:393-407
Subject Terms: Combinatorial optimization, Crane scheduling, Dynamic programming, Polynomial-time algorithm, 0502 economics and business, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology
File Description: application/pdf
-
4
Authors:
Contributors:
Subject Terms: linear theory, FOS: Computer and information sciences, constraint satisfaction, polynomial-time algorithm, Mathematics - Logic, p-adic numbers, Computational Complexity (cs.CC), F.4.1, F.2.1, existential theory, Computer Science - Computational Complexity, NP-hardness, FOS: Mathematics, linear program feasibility, ddc:004, Logic (math.LO)
File Description: application/pdf
-
5
Authors:
Contributors:
Subject Terms: p-adic numbers, existential theory, linear theory, constraint satisfaction, linear program feasibility, NP-hardness, polynomial-time algorithm
File Description: application/pdf
Relation: Is Part Of LIPIcs, Volume 345, 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.25
-
6
Authors: et al.
Source: Journal of Mathematical Biology. 82(20)
Subject Terms: Orthology detection, Best matches, Unambiguous orthologs, Colored graphs, Cograph, Tree reconciliation, Polynomial-time algorithm
File Description: electronic
-
7
Authors: et al.
Source: Algorithms. 14(4)
Subject Terms: best matches, least resolved trees, graph completion, polynomial-time algorithm
File Description: electronic
-
8
Authors:
Subject Terms: linear convergence, linear programming, polynomial-time algorithm, speed of convergence, super linear convergence
Relation: https://zenodo.org/records/16785173; oai:zenodo.org:16785173; https://doi.org/10.5281/zenodo.16785173
-
9
Authors: et al.
Contributors: et al.
Source: ISSN: 0305-0483 ; Omega ; https://hal.science/hal-04887456 ; Omega, 2025, 133, pp.103260. ⟨10.1016/j.omega.2024.103260⟩.
Subject Terms: Energy-flexible production, Lot-sizing problem, Capacity planning, Renewable energy, Polynomial time algorithm, Complexity, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]
-
10
Authors:
Subject Terms: 000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung, Informatik, stable marriage, stable roommates, forced and forbidden pairs, incremental algorithms, rotations, NP-hardness, polynomial-time algorithm, W[1]-hardness, FPT
File Description: application/pdf
-
11
Authors: et al.
Contributors: et al.
Source: Leibniz International Proceedings in Informatics, LIPIcs
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), Tallinn, Estonia, 23-27 Aug 2021 [Conference proceedings]
Journal of Computer and System SciencesSubject Terms: FOS: Computer and information sciences, Temporal graph, Discrete Mathematics (cs.DM), polynomial-time algorithm, 0102 computer and information sciences, Computational Complexity (cs.CC), transitive orientation, 01 natural sciences, transitive closure, Computer Science - Computational Complexity, satisfiability, Computer Science - Data Structures and Algorithms, NP-hardness, Data Structures and Algorithms (cs.DS), ddc:004, Computer Science - Discrete Mathematics
File Description: application/pdf
Access URL: http://arxiv.org/abs/2102.06783
http://livrepository.liverpool.ac.uk/3139714/1/MFCS_2021_paper_113.pdf
https://drops.dagstuhl.de/opus/volltexte/2021/14515/
https://drops.dagstuhl.de/opus/volltexte/2021/14515/pdf/LIPIcs-MFCS-2021-75.pdf/
http://dro.dur.ac.uk/33335/
https://arxiv.org/abs/2102.06783
https://arxiv.org/pdf/2102.06783
https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-06783
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.75
http://dro.dur.ac.uk/33335/
http://dro.dur.ac.uk/33335/1/33335.pdf
http://dro.dur.ac.uk/33335/2/33335VoR.pdf
https://doi.org/10.4230/LIPIcs.MFCS.2021.75 -
12
Authors: et al.
Source: European Journal of Operational Research. 307:82-102
Subject Terms: Deterministic scheduling theory in operations research, polynomial-time algorithm, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, robust optimization, scheduling, batch scheduling, 02 engineering and technology, shortest path problem
File Description: application/xml
-
13
Authors: et al.
Source: Lecture Notes in Computer Science ISBN: 9783030744311
Subject Terms: FOS: Computer and information sciences, 0301 basic medicine, History, Discrete Mathematics (cs.DM), Bioinformatics, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Image color analysis, Polynomial-time algorithm, 03 medical and health sciences, 106005 Bioinformatik, Computer Science - Data Structures and Algorithms, NP-hardness, binary trees, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), integer linear program, Quantitative Biology - Populations and Evolution, Phylogeny, Vegetation, Integer Linear Program, polynomial-time algorithm, Populations and Evolution (q-bio.PE), Best match graphs, Genomics, Programming, Linear, Binary trees, rooted triple consistency, Rooted triple consistency, Computer Science - Computational Complexity, FOS: Biological sciences, Combinatorics (math.CO), 106005 Bioinformatics, Algorithms, Computer Science - Discrete Mathematics
Access URL: http://arxiv.org/pdf/2011.00511
https://pubmed.ncbi.nlm.nih.gov/35044918
http://arxiv.org/abs/2011.00511
https://ucrisportal.univie.ac.at/de/publications/65ae17ae-0532-452b-9951-fef6c839b1b2
https://doi.org/10.1109/TCBB.2022.3143870
https://dblp.uni-trier.de/db/journals/corr/corr2011.html#abs-2011-00511
https://link.springer.com/chapter/10.1007/978-3-030-74432-8_6 -
14
Authors: et al.
Contributors: et al.
Subject Terms: Matroids, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), ddc:004, Combinatorial reconfiguration, Polynomial-time algorithm, Inapproximability, Computer Science - Discrete Mathematics
File Description: application/pdf
-
15
Authors: Muhammad Tlas
Source: Network Biology, Vol 13, Iss 4, Pp 122-136 (2023)
Subject Terms: maximum flow problem, bit-capacity scaling algorithm, polynomial time algorithm, augmenting path method, network flow, Biology (General), QH301-705.5
File Description: electronic resource
Relation: http://www.iaees.org/publications/journals/nb/articles/2023-13(4)/maximal-constrained-network-flow-problem.pdf; https://doaj.org/toc/2220-8879
-
16
Authors:
Source: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977073
Subject Terms: ddc:510, ddc:004, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Binäre polynomielle Optimierung, Algorithmus mit stark polynomialer Zeit, Azyklische Hypergraphen, Härte der Approximation, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Binary polynomial optimization, Strongly polynomial-time algorithm, Acyclic hypergraphs, Hardness of approximation, Optimization and Control (math.OC), FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Optimization and Control, Computer Science - Discrete Mathematics
-
17
Authors:
Contributors:
Source: Lecture Notes in Computer Science ISBN: 9783031113208
Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Complete axiomatization, Functional dependence, Computer and information sciences, Armstrong relations, Marginal distribution equivalence, Probabilistic team semantics, Polynomial-time algorithm, Mathematics, Logic in Computer Science (cs.LO)
File Description: application/pdf
-
18
Authors: et al.
Source: Lecture Notes in Computer Science ISBN: 9783030604394
Subject Terms: CIS graph, Strong clique, NP-težek problem, strong clique, strongly perfect graph, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, algoritem linearne časovne zahtevnosti, 01 natural sciences, Polynomial-time algorithm, krepko popoln graf, Principes généraux des mathématiques, Diamond-free graph, Simplicial clique, lastnost Erdősa in Hajnala, FOS: Mathematics, Mathematics - Combinatorics, Maximal clique, simplicialna klika, maximal stable set, Maximal stable set, Erdős-Hajnal property, graf brez diamantov, maksimalna klika, polynomial-time algorithm, krepka klika, Strongly perfect graph, CIS graf, maximal clique, simplicial clique, diamond-free graph, linear-time algorithm, polinomski algoritem, maksimalna neodvisna množica, NP-hard problem, Combinatorics (math.CO)
File Description: text/url
Access URL: http://arxiv.org/pdf/2006.13822
http://arxiv.org/abs/2006.13822
https://link.springer.com/chapter/10.1007%2F978-3-030-60440-0_21
https://www.sciencedirect.com/science/article/pii/S0304397520307088
https://rd.springer.com/chapter/10.1007/978-3-030-60440-0_21
https://repozitorij.upr.si/IzpisGradiva.php?id=14263&lang=slv
https://dblp.uni-trier.de/db/journals/tcs/tcs858.html#ChiarelliMMMM21
https://hdl.handle.net/20.500.12556/RUP-14263
https://repozitorij.upr.si/IzpisGradiva.php?id=14263
https://doi.org/10.1007/978-3-030-60440-0_21 -
19
Authors: Dvir Shabtay
Source: European Journal of Operational Research. 296:423-439
Subject Terms: controllable processing time, machine unavailability period, Deterministic scheduling theory in operations research, single-machine scheduling, pseudo polynomial time algorithm, 0211 other engineering and technologies, resource allocation, 02 engineering and technology, approximation algorithms, 12. Responsible consumption
File Description: application/xml
-
20
Authors: et al.
Contributors: et al.
Subject Terms: Convex graph, Mim-width, Polynomial-time algorithm, Width parameter, Settore INFO-01/A - Informatica
Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001114927300001; volume:140; journal:JOURNAL OF COMPUTER AND SYSTEM SCIENCES; https://hdl.handle.net/11381/2965393
Full Text 
Full Text Finder 
Nájsť tento článok vo Web of Science