Výsledky vyhledávání - "General topics of discrete mathematics in relation to computer science"

Stable Approximation Algorithms for Dominating Set and Independent Set: Stable approximation algorithms for dominating set and independent set

Autoři: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Přispěvatelé: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Zdroj: SIAM Journal on Discrete Mathematics. 39:921-945

Témata: FOS: Computer and information sciences, dynamic algorithms, Discrete Mathematics (cs.DM), Analysis of algorithms and problem complexity, General topics of discrete mathematics in relation to computer science, dominating set, stability, Approximation algorithms, bounded recourse, independent set, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, approximation algorithms, Dynamic algorithms, Computer Science - Discrete Mathematics

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2412.13358
https://zbmath.org/8037180
https://doi.org/10.1137/24m1644079
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.27

Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams: Linear expected complexity for directional and multiplicative Voronoi diagrams

Autoři: Chenglin Fan Benjamin Raichel Chenglin Fan and Benjamin Raichel

Přispěvatelé: Chenglin Fan Benjamin Raichel Chenglin Fan and Benjamin Raichel

Zdroj: Discrete & Computational Geometry. 73:1-24

Témata: expected complexity, Computational Geometry (cs.CG), FOS: Computer and information sciences, Computational Geometry, Voronoi Diagrams, General topics of discrete mathematics in relation to computer science, 0102 computer and information sciences, 01 natural sciences, Voronoi diagrams, computational geometry, Computer Science - Computational Geometry, Geometric probability and stochastic geometry, ddc:004, 0101 mathematics, Expected Complexity

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2004.09385
https://zbmath.org/7966734
https://doi.org/10.1007/s00454-024-00705-2
https://drops.dagstuhl.de/opus/volltexte/2020/12911/pdf/LIPIcs-ESA-2020-45.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2004.html#abs-2004-09385
https://drops.dagstuhl.de/opus/volltexte/2020/12911/
https://doi.org/10.4230/LIPIcs.ESA.2020.45
http://ui.adsabs.harvard.edu/abs/2020arXiv200409385F/abstract
https://arxiv.org/abs/2004.09385
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.45

Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem: Stable approximation algorithms for the dynamic broadcast range-assignment problem

Autoři: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Přispěvatelé: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Zdroj: SIAM Journal on Discrete Mathematics. 38:790-827

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, broadcast range assignment, online algorithms, stable approximation schemes, Analysis of algorithms and problem complexity, Discrete geometry, General topics of discrete mathematics in relation to computer science, 0102 computer and information sciences, 68W27, 68Q25, 01 natural sciences, Computational geometry, bounded recourse, F.2.2, F.2.3, Computer graphics, computational geometry (digital and algorithmic aspects), Computer Science - Data Structures and Algorithms, computational geometry, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, broadcast range assignement

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2112.05426
https://research.tue.nl/en/publications/e5bf163d-884a-4515-8198-681071448b9c
https://doi.org/10.4230/LIPIcs.SWAT.2022.15
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.15

On the algebraic immunity—resiliency trade-off, implications for Goldreich’s pseudorandom generator: On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator

Autoři: Aurélien Dupin Pierrick Méaux Mélissa Rossi

Zdroj: Designs, Codes and Cryptography. 91:3035-3079

Témata: algebraic immunity, Cryptography, resiliency, General topics of discrete mathematics in relation to computer science, Boolean functions, local pseudorandom generator

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/7735223
https://doi.org/10.1007/s10623-023-01220-w

Compact enumeration for scheduling one machine

Autoři: Vakhania, Nodari

Témata: FOS: Computer and information sciences, Data Structures and Algorithms, 0211 other engineering and technologies, 68R01 General topics of discrete mathematics in relation to computer science, Data Structures and Algorithms (cs.DS), 02 engineering and technology

Přístupová URL adresa: http://arxiv.org/abs/2103.09900

On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem: On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem

Autoři: Kripasindhu Sikdar Sounaka Mishra

Zdroj: Lecture Notes in Computer Science ISBN: 9783540678236

Témata: minimum linear ordering problem, 4. Education, 0211 other engineering and technologies, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), General topics of discrete mathematics in relation to computer science, 0102 computer and information sciences, 02 engineering and technology, NP-optimization problems, 7. Clean energy, 01 natural sciences, Approximation algorithms

Popis souboru: application/xml

Přístupová URL adresa: http://www.numdam.org/item/ITA_2001__35_3_287_0.pdf
https://link.springer.com/content/pdf/10.1007%2F3-540-44929-9_15.pdf
https://zbmath.org/1709146
https://doi.org/10.1051/ita:2001121
https://dblp.uni-trier.de/db/conf/ifipTCS/ifipTCS2000.html#MishraS00
https://link.springer.com/content/pdf/10.1007%2F3-540-44929-9_15.pdf
https://link.springer.com/chapter/10.1007%2F3-540-44929-9_15
https://rd.springer.com/chapter/10.1007/3-540-44929-9_15
https://www.rairo-ita.org/10.1051/ita:2001121
https://www.cambridge.org/core/journals/rairo-theoretical-informatics-and-applications/article/on-the-hardness-of-approximating-some-npoptimization-problems-related-to-minimum-linear-ordering-problem/BAA32E50BCC7F6BBE00FCF670FEF9702
https://dblp.uni-trier.de/db/journals/ita/ita35.html#MishraS01
https://www.rairo-ita.org/articles/ita/abs/2001/03/ita0104/ita0104.html

Graphs and plausibility logic

Autoři: P. Ruesga M. Rodriguez José M. Rodríguez a další

Zdroj: International Mathematical Forum. 2:2055-2063

Témata: graphs, Logic in computer science, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), computational logic, formal logic, logic of plausibility, General topics of discrete mathematics in relation to computer science, trees, Trees

Popis souboru: application/xml

Přístupová URL adresa: http://www.m-hikari.com/imf-password2007/41-44-2007/sigarretaIMF41-44-2007.pdf

Lower Bounds from Tile Covers for the Channel Assignment Problem: Lower bounds from tile covers for the channel assignment problem

Autoři: Jeannette Janssen T. E. Wentzell S. L. Fitzpatrick

Zdroj: SIAM Journal on Discrete Mathematics. 18:679-696

Témata: Graph labelling (graceful graphs, bandwidth, etc.), Discrete location and assignment, 0203 mechanical engineering, Polyhedral combinatorics, branch-and-bound, branch-and-cut, polyhedral lower bounds, 0211 other engineering and technologies, General topics of discrete mathematics in relation to computer science, 02 engineering and technology, Programming involving graphs or networks, labeling

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2206258
https://doi.org/10.1137/s0895480101384402
https://DalSpace.library.dal.ca/bitstream/10222/33626/1/JANSSEN_s0895480101384402.pdf
https://dalspace.library.dal.ca/xmlui/handle/10222/33626
https://doi.org/10.1137/S0895480101384402
https://dblp.uni-trier.de/db/journals/siamdm/siamdm18.html#JanssenWF05
https://epubs.siam.org/doi/abs/10.1137/S0895480101384402

Algebraic Graph Theory for Sparse Flexibility Matrices: Algebraic graph theory for sparse flexibility matrices

Autoři: Ali Kaveh Hossein Rahami

Zdroj: Journal of Mathematical Modelling and Algorithms. 2:171-182

Témata: Combinatorial optimization, Graphs and linear algebra (matrices, eigenvalues, etc.), suboptimal cycle bases, sparsity, algebraic graph theory, General topics of discrete mathematics in relation to computer science, 0102 computer and information sciences, 0101 mathematics, force method, 01 natural sciences, statical bases

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1976073
https://doi.org/10.1023/a:1024977604724
https://dblp.uni-trier.de/db/journals/jmma/jmma2.html#KavehR03
https://link.springer.com/article/10.1023%2FA%3A1024977604724

A classification of periodic turtle sequences

Autoři: A. Wagaman Judy A. Holdener

Zdroj: International Journal of Mathematics and Mathematical Sciences, Vol 2003, Iss 34, Pp 2193-2201 (2003)

Témata: Combinatorics on words, 0103 physical sciences, QA1-939, General topics of discrete mathematics in relation to computer science, 01 natural sciences, Mathematics

Popis souboru: application/xml

Přístupová URL adresa: http://downloads.hindawi.com/journals/ijmms/2003/710958.pdf
https://zbmath.org/1930100
https://doi.org/10.1155/s0161171203209078
https://doaj.org/article/5e9f1a4f3f1942d38bbb8b53b636d8d0
https://works.bepress.com/judy_holdener/4/download/
https://downloads.hindawi.com/journals/ijmms/2003/710958.pdf
https://www.emis.de/journals/HOA/IJMMS/Volume2003_34/2201.pdf
https://works.bepress.com/judy_holdener/4/
https://repository.library.georgetown.edu/handle/10822/533386
http://digital.kenyon.edu/cgi/viewcontent.cgi?article=1032&context=math_pubs

Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems: Software implementation of finite fields of characteristic three, for use in pairing-based crypto\-systems

Autoři: Harrison, Keith Page, Daniel Smart, Nigel P

Zdroj: LMS Journal of Computation and Mathematics. 5:181-193

Témata: Data encryption (aspects in computer science), 4. Education, Cryptography, 0202 electrical engineering, electronic engineering, information engineering, Algebraic coding theory, cryptography (number-theoretic aspects), Applications to coding theory and cryptography of arithmetic geometry, General topics of discrete mathematics in relation to computer science, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://www.cambridge.org/core/services/aop-cambridge-core/content/view/D703DCA6B779C83BBD82BB6B336AB98B/S1461157000000747a.pdf/div-class-title-software-implementation-of-finite-fields-of-characteristic-three-for-use-in-pairing-based-cryptosystems-div.pdf
https://www.cambridge.org/core/journals/lms-journal-of-computation-and-mathematics/article/software-implementation-of-finite-fields-of-characteristic-three-for-use-in-pairingbased-cryptosystems/D703DCA6B779C83BBD82BB6B336AB98B
https://ci.nii.ac.jp/naid/10020249824
https://research-information.bris.ac.uk/en/publications/software-implementation-of-finite-fields-of-characteristic-three-
http://www.journals.cambridge.org/abstract_S1461157000000747
http://research-information.bristol.ac.uk/en/publications/software-implementation-of-finite-fields-of-characteristic-three-for-use-in-pairing-based-cryptosystems(aa0d7877-3a9e-4fed-99ab-16c19ce3058c)/export.html

A Note on Iterating an $\alpha$-ary Gray Code: A note on iterating an \(\alpha\)-ary Gray code

Autoři: Shi-Chun Tsai Chi-Jen Lu

Zdroj: SIAM Journal on Discrete Mathematics. 14:237-239

Témata: Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, binomial coefficient, General topics of discrete mathematics in relation to computer science, 0102 computer and information sciences, 02 engineering and technology, gray code, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1608829
https://doi.org/10.1137/s0895480100367688
https://epubs.siam.org/doi/abs/10.1137/S0895480100367688
https://doi.org/10.1137/S0895480100367688
https://dblp.uni-trier.de/db/journals/siamdm/siamdm14.html#LuT01