Výsledky vyhledávání - "Exponential-time algorithm"

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics

Autoři: Nederlof, Jesper Pawlewicz, Jakub Swennenhuis, Céline M. F. a další

Přispěvatelé: Nederlof, Jesper Pawlewicz, Jakub Swennenhuis, Céline M. F. a další

Zdroj: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611976465
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)
SIAM Journal on Computing

Témata: FOS: Computer and information sciences, cs.DS, F.2, Computer Science - Data Structures and Algorithms, 68Q25, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://epubs.siam.org/doi/pdf/10.1137/1.9781611976465.102
http://arxiv.org/abs/2007.08204
http://10.10.70.176:8080/experts/en/publications/f7b6245d-409c-4fae-aa1e-aedd5a0b3ce3
https://doi.org/10.48550/arXiv.2007.08204
https://arxiv.org/abs/2007.08204
https://research.tue.nl/en/publications/a-faster-exponential-time-algorithm-for-bin-packing-with-a-consta-2
https://dblp.uni-trier.de/db/journals/corr/corr2007.html#abs-2007-08204
https://www.siam.org/conferences/cm/program/accepted-papers/soda21-accepted-papers#6
https://arxiv.org/abs/2007.08204
https://arxiv.org/pdf/2007.08204v1
https://arxiv.org/pdf/2007.08204.pdf
http://ui.adsabs.harvard.edu/abs/2020arXiv200708204N/abstract
http://export.arxiv.org/pdf/2007.08204
https://dspace.library.uu.nl/handle/1874/416092
https://dspace.library.uu.nl/handle/1874/416102

An Exponential Time Algorithm for Multilevel Quantization in Distributed Detection

Autoři: Gokhan Gul Michael Babler

Zdroj: 2021 29th European Signal Processing Conference (EUSIPCO). :2015-2019

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Errata to: 'Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games'

Autoři: Austin, Peter Dell'Erba, Daniele

Témata: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2310.04130

A single exponential time algorithm for homogeneous regular sequence tests

Autoři: Amir Hashemi Benyamin M. Alizadeh Hossein Parnian a další

Zdroj: Journal of Algebra and Its Applications. 23

Témata: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

An Inclusion-Exclusion based general exponential-time algorithm for the solution of unrelated parallel machine scheduling problems

Autoři: Ploton, Olivier T'kindt, Vincent PLOTON, OLIVIER

Přispěvatelé: Ploton, Olivier T'kindt, Vincent PLOTON, OLIVIER

Témata: [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC]

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.science/hal-03894305v1

Checking dynamic consistency of conditional hyper temporal networks via mean payoff games: Hardness and (pseudo) singly-exponential time algorithm

Autoři: Comin, Carlo Rizzi, Romeo Gambette, Philippe

Přispěvatelé: Comin, Carlo Rizzi, Romeo Gambette, Philippe

Zdroj: Information and Computation. 259:348-374

Témata: FOS: Computer and information sciences, Conditional Temporal Networks, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Hyper Temporal Networks, Computational Complexity (cs.CC), Mean Payoff Games, Simple Temporal Networks, 01 natural sciences, Computer Science - Computational Complexity, Dynamic Consistency, Reaction Time, Conditional temporal networks, Dynamic consistency, Mean payoff games, Simple temporal networks, Hyper temporal networks, Singly-exponential time, Reaction time, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Singly-Exponential Time

Popis souboru: application/pdf

Přístupová URL adresa: https://hal-upec-upem.archives-ouvertes.fr/hal-01719175/file/conditional-temporal-networks16.pdf
http://arxiv.org/abs/1602.06260
https://iris.univr.it/handle/11562/988557
https://doi.org/10.1016/j.ic.2017.08.008
https://dblp.uni-trier.de/db/journals/corr/corr1602.html#CominR16
https://www.sciencedirect.com/science/article/pii/S0890540117301499
http://ui.adsabs.harvard.edu/abs/2016arXiv160206260C/abstract
https://hal-enpc.archives-ouvertes.fr/hal-01719175v1

A Moderately Exponential Time Algorithm for k-IBDD Satisfiability

Autoři: Atsuki Nagao Junichi Teruyama Kazuhisa Seto

Zdroj: Lecture Notes in Computer Science ISBN: 9783319218397

Témata: 2. Zero hunger, 0202 electrical engineering, electronic engineering, information engineering, 1. No poverty, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: http://dblp.uni-trier.de/db/conf/wads/wads2015.html#NagaoST15
https://rd.springer.com/chapter/10.1007/978-3-319-21840-3_46
https://link.springer.com/chapter/10.1007/978-3-319-21840-3_46
https://doi.org/10.1007/978-3-319-21840-3_46
https://dblp.uni-trier.de/db/conf/wads/wads2015.html#NagaoST15
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica80.html#NagaoST18
https://doi.org/10.1007/s00453-017-0332-2
https://link.springer.com/article/10.1007/s00453-017-0332-2
https://link.springer.com/article/10.1007/s00453-017-0332-2/fulltext.html

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics.

Autoři: Sub Algorithms and Complexity Algorithms and Complexity Nederlof, Jesper a další

URL: https://doi.org/10.1137/1.9781611976465.102
http://hdl.handle.net/1874/416102
1682
1701

A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games (Track B: Automata, Logic, Semantics, and Theory of Programming)

Autoři: Dorfman, Dani Kaplan, Haim Zwick, Uri a další

Přispěvatelé: Dorfman, Dani Kaplan, Haim Zwick, Uri a další

Témata: Energy Games, ddc:004, Mean Payoff Games, Scaling

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.114

A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT

Autoři: Hoi, Gordon Jain, Sanjay Stephan, Frank a další

Přispěvatelé: Hoi, Gordon Jain, Sanjay Stephan, Frank a další

Témata: FOS: Computer and information sciences, Exponential Time Algorithms, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Maximum Hamming Distance of Solutions, Computer Science - Computational Complexity, X3SAT Problem, Computer Science - Data Structures and Algorithms, DPLL Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1910.01293
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.17

A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games

Autoři: Dorfman, Dani Kaplan, Haim Zwick, Uri

Témata: Energy Games, Mean Payoff Games, Scaling, Data processing Computer science, InProceedings, publishedVersion

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics

Autoři: Nederlof, Jesper Pawlewicz, Jakub Swennenhuis, Céline M. F. a další

Zdroj: (2020) date: 2020-07-15

Témata: cs.DS, 68Q25, F.2, Preprint

URL: https://research-portal.uu.nl/en/publications/f7b6245d-409c-4fae-aa1e-aedd5a0b3ce3
https://dspace.library.uu.nl/bitstream/handle/1874/416092/2007.08204v3.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/416092/2007.08204v3.pdf?sequence=1

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics

Autoři: Sub Algorithms and Complexity Algorithms and Complexity Nederlof, Jesper a další

URL: https://doi.org/10.48550/arXiv.2007.08204
http://hdl.handle.net/1874/416092
https://dspace.library.uu.nl/handle/1874/416092
https://arxiv.org/abs/2007.08204
1
41

A FASTER EXPONENTIAL TIME ALGORITHM FOR BIN PACKING WITH A CONSTANT NUMBER OF BINS VIA ADDITIVE COMBINATORICS.

Autoři: NEDERLOF, JESPER PAWLEWICZ, JAKUB SWENNENHUIS, CÉLINE M. F. a další

Zdroj: SIAM Journal on Computing. 2023, Vol. 52 Issue 6, p1369-1412. 44p.

Témata: *BIN packing problem, *COMBINATORICS, *BINS, *ALGORITHMS

Geografický termín: THAILAND

A Practical Exponential-Time Algorithm on Sorting by Short Block-Moves

Autoři: Da-Ming Zhu Hui Fan Pei-Qiang Liu a další

Zdroj: 2009 3rd International Conference on Bioinformatics and Biomedical Engineering. :1-4

Témata: 0301 basic medicine, 03 medical and health sciences, 0102 computer and information sciences, 01 natural sciences

Přístupová URL adresa: http://ieeexplore.ieee.org/document/5162228/
https://ieeexplore.ieee.org/document/5162228/
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005162228

An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem

Autoři: Henning Fernau Daniel Binkele-Raible

Zdroj: Journal of Discrete Algorithms. 15:43-55

Témata: Computational Theory and Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, Exact exponential-time algorithms, NP-hard problems on directed graphs, Outbranching with a maximum number of leaves, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science

Přístupová URL adresa: https://dl.acm.org/citation.cfm?id=2240536
https://www.sciencedirect.com/science/article/abs/pii/S1570866712000548
https://www.sciencedirect.com/science/article/pii/S1570866712000548
https://core.ac.uk/display/82486981

An exact exponential time algorithm for counting bipartite cliques

Autoři: Kutzkov, Konstantin

Zdroj: Information Processing Letters. 112:535-539

Témata: Exact exponential time algorithms, Counting bipartite cliques, 4. Education, 0202 electrical engineering, electronic engineering, information engineering, Analysis of algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/ipl/ipl112.html#Kutzkov12
https://www.sciencedirect.com/science/article/pii/S0020019012001032
https://core.ac.uk/display/50526769
http://dblp.uni-trier.de/db/journals/ipl/ipl112.html#Kutzkov12

An Exact Exponential Time Algorithm for Power Dominating Set

Autoři: Henning Fernau Daniel Binkele-Raible

Zdroj: Algorithmica. 63:323-346

Témata: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica63.html#Binkele-RaibleF12
https://rd.springer.com/article/10.1007/s00453-011-9533-2
https://link.springer.com/content/pdf/10.1007%2Fs00453-011-9533-2.pdf
https://link.springer.com/article/10.1007/s00453-011-9533-2
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica63.html#Binkele-RaibleF12

A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations

Autoři: Panagiotis Voulgaris Daniele Micciancio

Zdroj: Proceedings of the forty-second ACM symposium on Theory of computing. :351-358

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: http://cseweb.ucsd.edu/%7Epvoulgar/files/voronoi.pdf
https://www.ams.jhu.edu/~abasu9/papers/voronoi_full.pdf
https://dblp.uni-trier.de/db/conf/stoc/stoc2010.html#MicciancioV10
https://core.ac.uk/display/103543297
https://cseweb.ucsd.edu/~pvoulgar/files/voronoi_full.pdf
https://doi.org/10.1145/1806689.1806739
https://dl.acm.org/doi/10.1145/1806689.1806739

Checking Dynamic Consistency of Conditional Hyper Temporal Networks via Mean Payoff Games (Hardness and (pseudo) Singly-Exponential Time Algorithm)

Autoři: Comin, Carlo Rizzi, Romeo

Témata: Computer Science - Computational Complexity, text

URL: http://arxiv.org/abs/1602.06260