Výsledky vyhľadávania - acm: f.: theory of computation/f.2: analysis of algorithms AND (problem OR problemy) complexity

Zdroj: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics.
39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
https://hal.science/hal-03573476
39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Mar 2022, Marseille, France. pp.1-15, ⟨10.4230/LIPIcs.STACS.2022.18⟩
https://stacs2022.sciencesconf.org/

Predmety: computability, tilings, effective subshift, sofic subshift, subshift of finite type, domino problem, aperiodicity, periodicity, subshift, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]

Geografické téma: Marseille, France

Dostupnosť: https://hal.science/hal-03573476
https://hal.science/hal-03573476v1/document
https://hal.science/hal-03573476v1/file/HAL.pdf
https://doi.org/10.4230/LIPIcs.STACS.2022.18

View record from BASE

Nájsť tento článok vo Web of Science

5

Analyse didactique d’un jeu de recherche : vers une situation fondamentale pour la complexité d’algorithmes et de problèmes

Autori: Meyer, Antoine Modeste, Simon Laboratoire d'Informatique Gaspard-Monge (LIGM) a ďalší

Prispievatelia: Meyer, Antoine Modeste, Simon Laboratoire d'Informatique Gaspard-Monge (LIGM) a ďalší

Zdroj: Didapro 8 – DidaSTIC, L’informatique, objets d’enseignements – enjeux épistémologiques, didactiques et de formation ; https://hal.science/hal-03014372 ; Didapro 8 – DidaSTIC, L’informatique, objets d’enseignements – enjeux épistémologiques, didactiques et de formation, Feb 2020, Lille, France ; https://www.didapro.org/8/

Predmety: complexité, algorithme, problème, didactique, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.6: Sorting and searching, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [SHS.EDU]Humanities and Social Sciences/Education

Geografické téma: Lille, France

Relation: https://hal.science/hal-02474983v1

Dostupnosť: https://hal.science/hal-03014372
https://hal.science/hal-03014372v1/document
https://hal.science/hal-03014372v1/file/Didapro_8_paper_6.pdf

View record from BASE

Nájsť tento článok vo Web of Science

6

Implementing number theoretic transforms

Autori: van der Hoeven, Joris Lecerf, Grégoire Centre National de la Recherche Scientifique (CNRS) a ďalší

Prispievatelia: van der Hoeven, Joris Lecerf, Grégoire Centre National de la Recherche Scientifique (CNRS) a ďalší

Zdroj: https://hal.science/hal-04841449 ; 2024.

Predmety: number theoretic transform, finite fields, codelets, algorithm, complexity bound, integer multiplication, FFT, MSC 68W30, 68Q17, 68W40, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems/F.2.1.4: Number-theoretic computations (e.g., factoring, primality testing), ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.0: General/G.1.0.0: Computer arithmetic, [INFO]Computer Science [cs], [MATH]Mathematics [math]

Relation: info:eu-repo/grantAgreement//101142171/EU/Solving differential equations fast, precisely, and reliably/ODELIX

Dostupnosť: https://hal.science/hal-04841449
https://hal.science/hal-04841449v1/document
https://hal.science/hal-04841449v1/file/ntt.pdf

View record from BASE

Nájsť tento článok vo Web of Science

7

On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics

Autori: Altisen, Karine Devismes, Stéphane Durand, Anaïs a ďalší

Prispievatelia: Altisen, Karine Devismes, Stéphane Durand, Anaïs a ďalší

Zdroj: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. :21-31

Predmety: pseudo-stabilization, sources, [INFO.INFO-DC]Computer Science [cs]/Distributed, sinks, speculation, leader election, dynamic graphs, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, 0102 computer and information sciences, ACM: F.: Theory of Computation, Parallel, 01 natural sciences, self-stabilization, and Cluster Computing [cs.DC], timely sinks, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], timely sources, [INFO]Computer Science [cs]

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.archives-ouvertes.fr/hal-02979166/file/evolvingSourceElection.pdf
https://hal.science/hal-03346225v1/document
https://doi.org/10.1145/3465084.3467917
https://hal.science/hal-03346225v1
https://hal.archives-ouvertes.fr/hal-02979166/document
https://dblp.uni-trier.de/db/conf/podc/podc2021.html#AltisenDDJP21
https://hal.archives-ouvertes.fr/hal-02979166
https://dl.acm.org/doi/pdf/10.1145/3465084.3467917
https://www.podc.org/podc2021/list-of-accepted-papers/#17

View record at OpenAIRE

Nájsť tento článok vo Web of Science

8

Deterministic factoring with oracles ; Factorisation d'entiers déterministes à l'aide d'oracles

Autori: Morain, François Renault, Guénaël Smith, Benjamin a ďalší

Prispievatelia: Morain, François Renault, Guénaël Smith, Benjamin a ďalší

Zdroj: ISSN: 0938-1279.

Predmety: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems/F.2.1.4: Number-theoretic computations (e.g., factoring, primality testing), [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1802.08444; ARXIV: 1802.08444

Dostupnosť: https://inria.hal.science/hal-01715832
https://inria.hal.science/hal-01715832v2/document
https://inria.hal.science/hal-01715832v2/file/hal-oracles.pdf
https://doi.org/10.1007/s00200-021-00521-8

View record from BASE

Nájsť tento článok vo Web of Science

9

Synchronous Gathering without Multiplicity Detection: a Certified Algorithm

Autori: Thibaut Balabonski Sébastien Tixeuil Lionel Rieg a ďalší

Prispievatelia: Thibaut Balabonski Sébastien Tixeuil Lionel Rieg a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783319492582

Predmety: [INFO.INFO-DC]Computer Science [cs]/Distributed, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.5: Reliability/D.4.5.2: Fault-tolerance, Parallel, 01 natural sciences, and Cluster Computing [cs.DC], ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, [INFO]Computer Science [cs], ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs/F.3.1.3: Mechanical verification, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.3: Studies of Program Constructs/F.3.3.4: Type structure

Popis súboru: application/pdf

Prístupová URL adresa: https://link.springer.com/article/10.1007/s00224-017-9828-z
https://hal.archives-ouvertes.fr/hal-01894618
https://doi.org/10.1007/s00224-017-9828-z
https://dblp.uni-trier.de/db/journals/mst/mst63.html#BalabonskiDRTU19
https://rd.springer.com/chapter/10.1007/978-3-319-49259-9_2
https://doi.org/10.1007/978-3-319-49259-9_2
https://hal.archives-ouvertes.fr/hal-01491813
https://dblp.uni-trier.de/db/conf/sss/sss2016.html#BalabonskiDRTU16
https://link.springer.com/chapter/10.1007/978-3-319-49259-9_2
http://dblp.uni-trier.de/db/conf/sss/sss2016.html#BalabonskiDRTU16
https://hal.science/hal-01894618v1/document
https://doi.org/10.1007/s00224-017-9828-z
https://hal.science/hal-01894618v1
https://hal.sorbonne-universite.fr/hal-01491813v1
https://doi.org/10.1007/978-3-319-49259-9_2

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

10

On the complexity of theF5Gröbner basis algorithm

Autori: Bardet, Magali Faugère, Jean-Charles Salvy, Bruno a ďalší

Prispievatelia: Bardet, Magali Faugère, Jean-Charles Salvy, Bruno a ďalší

Zdroj: Journal of Symbolic Computation. 70:49-70

Predmety: [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], Computer Science - Symbolic Computation, FOS: Computer and information sciences, [INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC], Complexity, Symbolic Computation (cs.SC), 16. Peace & justice, 01 natural sciences, Noether Position, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, Regular Sequences, 13. Climate action, Gröbner bases, F5 algorithm, 0101 mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/1312.1655
https://www.sciencedirect.com/science/article/abs/pii/S0747717114000935
https://arxiv.org/pdf/1312.1655
https://dblp.uni-trier.de/db/journals/corr/corr1312.html#BardetFS13
https://arxiv.org/abs/1312.1655
https://dl.acm.org/doi/10.1016/j.jsc.2014.09.025
https://hal.inria.fr/hal-01064519/document

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

11

Relationship between superstring and compression measures: New insights on the greedy conjecture

Autori: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) a ďalší

Prispievatelia: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) a ďalší

Zdroj: Discrete Applied Mathematics. 245:59-64

Predmety: 2. Zero hunger, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Assembly, Greedy conjecture, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: F.: Theory of Computation, Approximation algorithm, 01 natural sciences, 7. Clean energy, 12. Responsible consumption, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, Shortest Common Superstring Problem, Data compression, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Stringology, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Popis súboru: application/pdf

Prístupová URL adresa: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01800340
https://www.sciencedirect.com/science/article/pii/S0166218X1730183X
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01800340/document
https://www.sciencedirect.com/science/article/abs/pii/S0166218X1730183X

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

12

Towards a Realistic Analysis of Some Popular Sorting Algorithms

Autori: Clément, Julien Nguyen Thi, Thu Hien Vallée, Brigitte a ďalší

Prispievatelia: Clément, Julien Nguyen Thi, Thu Hien Vallée, Brigitte a ďalší

Zdroj: Combinatorics, Probability and Computing. 24:104-144

Predmety: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], 68Q87, 68P10, 68Q17Secondary 68W05, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.6: Sorting and searching, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 68Q25, 68W40, 94A17, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 68P05, 94A15, 01 natural sciences, 30D10, 30E20, 30E15, 97I80, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], 0101 mathematics, Primary 68W32

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01103998/file/cpc-PF-style.pdf
https://dblp.uni-trier.de/db/journals/cpc/cpc24.html#ClementTV15
https://hal.archives-ouvertes.fr/hal-01103998

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

13

On the Worst-Case Complexity of TimSort

Autori: Auger, Nicolas Jugé, Vincent Nicaud, Cyril a ďalší

Prispievatelia: Auger, Nicolas Jugé, Vincent Nicaud, Cyril a ďalší

Zdroj: 26th Annual European Symposium on Algorithms (ESA 2018)
https://hal.science/hal-01798381
26th Annual European Symposium on Algorithms (ESA 2018), Aug 2018, Helsinki, Finland. pp.4:1--4:13, ⟨10.4230/LIPIcs.ESA.2018.4⟩

Predmety: Sorting algorithms, Merge sorting algorithms, Analysis of al-gorithms, TimSort, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.6: Sorting and searching, [INFO]Computer Science [cs], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Geografické téma: Helsinki, Finland

Dostupnosť: https://hal.science/hal-01798381
https://hal.science/hal-01798381v1/document
https://hal.science/hal-01798381v1/file/timsort2018.pdf
https://doi.org/10.4230/LIPIcs.ESA.2018.4

View record from BASE

Nájsť tento článok vo Web of Science

14

Linking indexing data structures to de Bruijn graphs: Construction and update

Autori: Cazaux, Bastien Lecroq, Thierry Rivals, Eric a ďalší

Prispievatelia: Cazaux, Bastien Lecroq, Thierry Rivals, Eric a ďalší

Zdroj: Journal of Computer and System Sciences. 104:165-183

Predmety: Overlap, 2. Zero hunger, Contracted de Bruijn graph, Bioinformatics, Computer Networks and Communications, Applied Mathematics, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Assembly, 0206 medical engineering, 1. No poverty, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Dynamic update, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Index, Theoretical Computer Science, Suffix tree, Computational Theory and Mathematics, Data structure, Suffix array, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Algorithms, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Popis súboru: application/pdf

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/jcss/jcss104.html#CazauxLR19
https://core.ac.uk/display/82441636
https://www.sciencedirect.com/science/article/pii/S0022000016300502
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01617207
https://doi.org/10.1016/j.jcss.2016.06.008
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01617207/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01617207v1/document
https://doi.org/10.1016/j.jcss.2016.06.008
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01617207v1

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

15

The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings

Autori: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) a ďalší

Prispievatelia: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) a ďalší

Zdroj: Discrete Applied Mathematics. 212:48-60

Predmety: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Assembly, Greedy conjecture, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Approximation algorithm, 01 natural sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, Shortest Superstring Problem, Data compression, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Stringology, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Prístupová URL adresa: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01286943v1
https://doi.org/10.1016/j.dam.2015.06.003

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

16

Glucagon and insulin production in pancreatic cells modeled using Petri nets and Boolean networks.

Autori: Barylska, Kamila Delaplace, Franck Gogolińska, Anna a ďalší

Prispievatelia: Barylska, Kamila Delaplace, Franck Gogolińska, Anna a ďalší

Zdroj: https://univ-evry.hal.science/hal-05183371 ; 2025.

Predmety: bioinformatics, analysis, modelling, Boolean networks, Petri nets, biological system, glucagon secretion, insulin secretion, diabetes, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: G.: Mathematics of Computing, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2504.21578v1; ARXIV: 2504.21578v1

Dostupnosť: https://univ-evry.hal.science/hal-05183371
https://doi.org/10.48550/arXiv.2504.21578

View record from BASE

Nájsť tento článok vo Web of Science

17

A linear time algorithm for Shortest Cyclic Cover of Strings

Autori: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) a ďalší

Prispievatelia: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) a ďalší

Zdroj: Journal of Discrete Algorithms. 37:56-67

Predmety: Overlap, Minimum assignment, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Superstring, 16. Peace & justice, 01 natural sciences, Graph, Theoretical Computer Science, 3. Good health, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Computational Theory and Mathematics, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Shortest cyclic cover of strings, Greedy, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Popis súboru: application/pdf

Prístupová URL adresa: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01525995
https://dblp.uni-trier.de/db/journals/jda/jda37.html#CazauxR16
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01525995/document
https://www.sciencedirect.com/science/article/pii/S1570866716300065
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01525995v1/document
https://doi.org/10.1016/j.jda.2016.05.001
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01525995v1

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

18

Anytime search strategies for constraints satisfaction problem ; Stratégies de résolution anytime de problèmes de satisfaction de contraintes numériques

Autori: Richard de Latour, Thomas Chenouard, Raphaël Granvilliers, Laurent a ďalší

Prispievatelia: Richard de Latour, Thomas Chenouard, Raphaël Granvilliers, Laurent a ďalší

Zdroj: Journée Francophone de la Programmation par Contrainte ; https://hal.science/hal-03563938 ; Journée Francophone de la Programmation par Contrainte, Jun 2021, Nice, France

Predmety: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.0: General/G.1.0.3: Interval arithmetic, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.0: General/G.1.0.5: Numerical algorithms, [INFO]Computer Science [cs]

Geografické téma: Nice, France

Time: Nice, France

Dostupnosť: https://hal.science/hal-03563938
https://hal.science/hal-03563938v1/document
https://hal.science/hal-03563938v1/file/Anytime_BPA_JFPC.pdf

View record from BASE

Nájsť tento článok vo Web of Science

19

Complexity of Token Swapping and its Variants

Autori: Bonnet, Edouard Miltzow, Tillmann Rzążewski, Paweł a ďalší

Prispievatelia: Bonnet, Edouard Miltzow, Tillmann Rzążewski, Paweł a ďalší

Zdroj: LIPICS ; 34th International Symposium on Theoretical Aspects of Computer Science (STACS 2017) ; https://hal.science/hal-01994385 ; 34th International Symposium on Theoretical Aspects of Computer Science (STACS 2017), Mar 2017, Hanovre, Germany. pp.16, ⟨10.4230/LIPIcs.STACS.2017.16⟩ ; https://stacs2017.thi.uni-hannover.de/

Predmety: token swapping, parameterized complexity, NP-hardness, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]