Výsledky vyhľadávania - acm: f.: theory of computation/f.2: analysis of algorithms AND (problem OR problemys) complexity*
-
1
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: IEEE Transactions on Signal Processing. 72:1130-1140
Predmety: Blind Source Separation and Independent Component Analysis, Artificial intelligence, Machine Fault Diagnosis and Prognostics, synthesis, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g, ACM: I.: Computing Methodologies/I.5: PATTERN RECOGNITION/I.5.4: Applications/I.5.4.1: Signal processing, Component (thermodynamics), Amplitude, Engineering, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, ridge extraction, Expectation–maximization algorithm, Speech Enhancement Techniques, Spectrogram, Estimation theory, Physics, Monte Carlo sampling, Mathematical optimization, Statistics, Programming language, Algorithm, SIGNAL (programming language), Physical Sciences, Telecommunications, Thermodynamics, Empirical Mode Decomposition, Signal processing, [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems/F.2.1.0: Computation of transforms (e.g, and processing, Instantaneous phase, Noise (video), Speech recognition, time-frequency, Quantum mechanics, ACM: G.: Mathematics of Computing, JEL: C - Mathematical and Quantitative Methods/C.C6 - Mathematical Methods • Programming Models • Mathematical and Simulation Modeling/C.C6.C63 - Computational Techniques • Simulation Modeling, FOS: Mathematics, Image (mathematics), Radar, fast Fourier transform), Bayesian estimation, Time–frequency analysis, Computer science, Control and Systems Engineering, Signal Processing, Computer Science, Maximization, Expectation-Maximization algorithm, HCI)/H.5.5: Sound and Music Computing/H.5.5.2: Signal analysis, Mathematics, Maximum likelihood
Popis súboru: application/pdf
-
2
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: 41st International Symposium on Computational Geometry (SoCG 2025)
https://hal.science/hal-04654840
41st International Symposium on Computational Geometry (SoCG 2025), Jun 2025, Kanazawa, Japan. pp.23:1-23:16, ⟨10.4230/LIPIcs.SoCG.2025.23⟩Predmety: computational topology, structural graph parameters, Whitney embedding theorem, twin-width, triangulations, MSC: 57Q15 (Primary) 57R05, 05C75, 57M15 (Secondary), 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, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2407.10174; ARXIV: 2407.10174
-
3
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Theoretical Computer Science. 775:76-92
Predmety: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Computational Social Choice, 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], Robust optimisation, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Algorithmic Complexity, 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], NP-completeness, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE, Stable Matching, Artificial inteligence, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], 0202 electrical engineering, electronic engineering, information engineering, Robust Stable Marriage, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Schaefer's Dichotomy, Robustness
Popis súboru: application/pdf
Prístupová URL adresa: https://hal.laas.fr/hal-01974431/file/19-TCS.pdf
https://www.sciencedirect.com/science/article/pii/S0304397518307503
https://doi.org/10.1016/j.tcs.2018.12.017
https://hal.laas.fr/hal-01974431/document
https://dblp.uni-trier.de/db/journals/tcs/tcs775.html#GencSSO19
https://hal.laas.fr/hal-01974431 -
4
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: ISSN: 0925-8531.
Predmety: Type-logical grammars, Proof theory, Proof nets, Parsing as deduction, 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, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.3: Deduction and Theorem Proving/I.2.3.1: Deduction (e.g., natural, rule-based), ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing, [INFO]Computer Science [cs]
-
5
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: https://hal.science/hal-03846646 ; 2021.
Predmety: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing
-
6
Autori: a ďalší
Prispievatelia: a ďalší
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]
-
7
Autori: a ďalší
Prispievatelia: 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]
Time: Nice, France
-
8
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Leibniz International Proceedings in Informatics (LIPIcs) ; 39th International Symposium on Computational Geometry (SoCG 2023) ; https://hal.science/hal-04055617 ; 39th International Symposium on Computational Geometry (SoCG 2023), Jun 2023, Dallas, United States. pp.42:1--42:18, ⟨10.4230/LIPIcs.SoCG.2023.42⟩
Predmety: fixed-parameter tractability, generalized Heegaard splittings, JSJ decompositions, pathwidth, treewidth, triangulations, computational 3-manifold topology, MSC: 57Q15, 57N10, 05C75, 57M15, 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, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Geografické téma: Dallas, United States
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2303.06789; ARXIV: 2303.06789
-
9
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: abstract simplicial complexes, Computational Geometry (cs.CG), FOS: Computer and information sciences, Submanifold reconstruction, 65D18, convexity, I.3.5, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.5: Computational Geometry and Object Modeling, triangulation, F.2.2, 65D18, 57Q05, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, 57Q05, Computer Science - Computational Geometry, [INFO]Computer Science [cs], collapses, ddc:004
Popis súboru: application/pdf
-
10
Autori: a ďalší
Prispievatelia: 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
Relation: https://hal.science/hal-02474983v1
-
11
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Networks. 69:52-66
Predmety: game theory, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0211 other engineering and technologies, non-linear programming, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.3: Network problems, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Approximation algorithms, Nash equilibrium, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], 6. Clean water, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.4: Routing and layout, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], best response, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.7: Nonlinear programming, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.4: Integer programming, single-path routing
Popis súboru: application/pdf
Prístupová URL adresa: https://hal.laas.fr/hal-01461689/file/camera_ready.pdf
https://dblp.uni-trier.de/db/journals/networks/networks69.html#BrunPV17
https://hal.laas.fr/hal-01461689/document
https://hal.archives-ouvertes.fr/hal-01245236v1
https://hal.laas.fr/hal-01461689
https://doi.org/10.1002/net.21720
https://hal-univ-tlse3.archives-ouvertes.fr/hal-01461689v1 -
12
Autori: a ďalší
Prispievatelia: 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 -
13
Autori: a ďalší
Prispievatelia: 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 -
14
Autori: a ďalší
Prispievatelia: 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 -
15
Autori: a ďalší
Prispievatelia: 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
-
16
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: https://hal.science/hal-04654840 ; 2024.
Predmety: triangulations, twin-width, Whitney embedding theorem, structural graph parameters, computational topology, MSC: 57Q15 (Primary) 57R05, 05C75, 57M15 (Secondary), 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, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2407.10174; ARXIV: 2407.10174
-
17
Autori: a ďalší
Prispievatelia: 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
-
18
Autori: a ďalší
Prispievatelia: 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
-
19
Autori: a ďalší
Prispievatelia: 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 -
20
Autori: a ďalší
Prispievatelia: 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
Full Text Finder 
Nájsť tento článok vo Web of Science