Suchergebnisse - "Subexponential-time algorithm"
-
1
Autoren:
Quelle: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611978322
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete AlgorithmsSchlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)
-
2
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: feedback edge number, Computational Geometry (cs.CG), FOS: Computer and information sciences, F.2, page number, G.2, book embedding, 7. Clean energy, subexponential algorithms, subhamiltonicity, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004
Dateibeschreibung: application/pdf
-
3
Autoren: et al.
-
4
Autoren:
Quelle: Annual ACM-SIAM Symposium on Discrete Algorithms
Dateibeschreibung: application/pdf
-
5
-
6
Autoren: Christoph Brause
Quelle: Discrete Applied Mathematics. 231:113-118
Schlagwörter: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
-
7
Autoren: et al.
Weitere Verfasser: et al.
Dateibeschreibung: text
Relation: https://eprints.whiterose.ac.uk/212222/8/A%20Tight%20Subexponential-Time%20Algorithm%20for.pdf; Ganian, R., Müller, H., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (2 more authors) (2024) A Tight Subexponential-time Algorithm for Two-Page Book Embedding. In: Bringmann, K., Grohe, M., Puppis, G. and Svensson, O., (eds.) 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). ICALP 2024, 08-12 Jul 2024, Tallinn, Estonia. Leibniz International Proceedings in Informatics (LIPIcs), 297 . Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , Wadern, Germany , 68:1-68:18. ISBN 978-3-95977-322-5
-
8
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ACM Transactions on Computation Theory. 16:1-18
Schlagwörter: FOS: Computer and information sciences, Mathematics of computing → Approximation algorithms, Discrete Mathematics (cs.DM), subexponential-time algorithm, Mathematics of computing → Graph algorithms, 4. Education, 7. Clean energy, subdivided claw, Max Independent Set, Theory of computation → Graph algorithms analysis, Computer Science - Data Structures and Algorithms, QPTAS, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics
Dateibeschreibung: application/pdf
-
9
Autoren: T. Elgamal
Quelle: Advances in Cryptology ISBN: 9781468447323
Schlagwörter: cryptography, probabilistic algorithm, quadratic field, Analysis of algorithms and problem complexity, Randomized algorithms, Algebraic coding theory, cryptography (number-theoretic aspects), logarithms, 02 engineering and technology, complexity analysis, 7. Clean energy, 01 natural sciences, subexponential algorithm, Cryptography, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, finite field, Number-theoretic algorithms, complexity
Dateibeschreibung: application/xml
Zugangs-URL: http://ieeexplore.ieee.org/document/1057075/
https://link.springer.com/content/pdf/10.1007%2F978-1-4684-4730-9_22.pdf
https://dblp.uni-trier.de/db/journals/tit/tit31.html#Elgamal85a
https://ieeexplore.ieee.org/abstract/document/1057075
https://link.springer.com/chapter/10.1007/978-1-4684-4730-9_22
https://rd.springer.com/chapter/10.1007/978-1-4684-4730-9_22 -
10
Autoren: Regev, Oded
Schlagwörter: Quantum Physics, 0103 physical sciences, FOS: Physical sciences, 0102 computer and information sciences, Quantum Physics (quant-ph), 01 natural sciences
Zugangs-URL: http://arxiv.org/abs/quant-ph/0406151
-
11
Autoren: et al.
Weitere Verfasser: et al.
Quelle: SIAM Journal on Discrete Mathematics. 36:2205-2224
Schlagwörter: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), subexponential-time algorithm, fine-grained complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, 3-coloring, diameter, 01 natural sciences, Computer Science - Discrete Mathematics
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2104.13860
https://dblp.uni-trier.de/db/journals/corr/corr2104.html#abs-2104-13860
https://drops.dagstuhl.de/opus/volltexte/2021/14618/
https://drops.dagstuhl.de/opus/volltexte/2021/14618/pdf/LIPIcs-ESA-2021-37.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.37 -
12
Autoren: et al.
Quelle: Discrete Applied Mathematics. 267:184-189
Schlagwörter: Path-decomposition, FOS: Computer and information sciences, partition function, Discrete Mathematics (cs.DM), subexponential-time algorithm, 0211 other engineering and technologies, 02 engineering and technology, 0102 computer and information sciences, path-decomposition, Pt-free, 01 natural sciences, Partition function, colouring, FOS: Mathematics, Subexponential-time algorithm, Mathematics - Combinatorics, Combinatorics (math.CO), Colouring, Computer Science - Discrete Mathematics
-
13
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Max Independent Set, subdivided claw, QPTAS, subexponential-time algorithm
Dateibeschreibung: application/pdf
Relation: Is Part Of LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.93
-
14
Autoren:
Weitere Verfasser:
Dateibeschreibung: application/pdf
-
15
Autoren:
Weitere Verfasser:
Dateibeschreibung: application/postscript
-
16
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 3-coloring, fine-grained complexity, subexponential-time algorithm, diameter
Dateibeschreibung: application/pdf
Relation: Is Part Of LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.37
-
17
Autoren: W. Ludwig
Quelle: Information and Computation. 117:151-155
Schlagwörter: Analysis of algorithms and problem complexity, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, randomized algorithm, Theoretical Computer Science, Computer Science Applications, Stochastic games, stochastic differential games, Computational Theory and Mathematics, subexponential time algorithm, stochastic game, Abstract computational complexity for mathematical programming problems, Information Systems
Dateibeschreibung: application/xml
-
18
Autoren:
Quelle: Journal of Mathematical Sciences. 70:1847-1872
Schlagwörter: exponential time, subexponential-time algorithm, Analysis of algorithms and problem complexity, Model-theoretic algebra, Computational aspects of field theory and polynomials, 0101 mathematics, Symbolic computation and algebraic computation, Semialgebraic sets and related spaces, connected components of a semialgebraic set, 01 natural sciences, first-order theory of real closed fields
Dateibeschreibung: application/xml
-
19
Autoren: Elgamal, T.
Quelle: IEEE Transactions on Information Theory; 1985, Vol. 31 Issue 4, p473-481, 9p
-
20
Autoren: ElGamal, Taher
Quelle: Advances in Cryptology ; page 275-292 ; ISBN 9781468447323 9781468447309
Nájsť tento článok vo Web of Science 
Full Text Finder