Suchergebnisse - "subexponential-time algorithm"
-
1
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
-
2
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 -
3
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
-
4
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
-
5
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
-
6
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
-
7
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
-
8
Autoren: N. N. Vorob'ev
Quelle: Journal of Soviet Mathematics. 34:1754-1762
Schlagwörter: real roots, systems of algebraic equations, Numerical computation of solutions to systems of equations, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Real polynomials: location of zeros, real algebraic variety, subexponential- time algorithm
Dateibeschreibung: application/xml
-
9
Autoren:
Weitere Verfasser:
Quelle: Journal of Symbolic Computation. 5:37-64
Schlagwörter: Algebra and Number Theory, Analysis of algorithms and problem complexity, algebraic complexity, [MATH] Mathematics [math], 0102 computer and information sciences, Symbolic computation and algebraic computation, 01 natural sciences, Computational Mathematics, Software, source code, etc. for problems pertaining to field theory, subexponential time algorithm, real solutions of systems of polynomial inequalities, Real algebraic and real-analytic geometry, Fields related with sums of squares (formally real fields, Pythagorean fields, etc.), 0101 mathematics, Polynomials (irreducibility, etc.)
Dateibeschreibung: application/pdf; application/xml
Zugangs-URL: https://hal.science/hal-03053133v1
https://zbmath.org/4081676
https://doi.org/10.1016/s0747-7171(88)80005-1
https://www.sciencedirect.com/science/article/pii/S0747717188800051
https://www.sciencedirect.com/science/article/pii/S0747717188800051#!
https://hal.archives-ouvertes.fr/hal-03053133
https://hal.archives-ouvertes.fr/hal-03053133/document
https://dblp.uni-trier.de/db/journals/jsc/jsc5.html#GrigorevVV88
https://dl.acm.org/doi/10.1016/S0747-7171%2888%2980005-1 -
10
Autoren: Vorob'ev, N. N.
Schlagwörter: real roots, systems of algebraic equations, Numerical computation of solutions to systems of equations, Real polynomials: location of zeros, real algebraic variety, subexponential- time algorithm
Dateibeschreibung: application/xml
Zugangs-URL: https://zbmath.org/3870491
-
11
Autoren:
Schlagwörter: factorization, Elliptic curves over global fields, discrete logarithm, subexponential time algorithm, Cryptography, elliptic curves, Algebraic coding theory, cryptography (number-theoretic aspects), heights, lifting
Dateibeschreibung: application/xml
Zugangs-URL: https://zbmath.org/1457622
-
12
Full Text Finder 
Nájsť tento článok vo Web of Science