Suchergebnisse - "computational and structural complexity"

Finer-grained reductions in fine-grained hardness of approximation

Autoren: Elie Abboud Noga Ron-Zewi Elie Abboud and Noga Ron-Zewi

Weitere Verfasser: Elie Abboud Noga Ron-Zewi Elie Abboud and Noga Ron-Zewi

Quelle: Theoretical Computer Science. 1026:114976

Schlagwörter: Computational Geometry (cs.CG), FOS: Computer and information sciences, fine-grained reduction, Fine-grained complexity, Computational and structural complexity theory, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Approximation algorithms, Computational geometry, Computer Science - Computational Complexity, conditional lower bound, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Computational Geometry, Analysis of algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2311.00798
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.7

Deadlock prevention by acyclic orientations

Autoren: Bermond, Jean-Claude Ianni, Miriam Di Flammini, Michele et al.

Weitere Verfasser: Bermond, Jean-Claude Ianni, Miriam Di Flammini, Michele et al.

Quelle: Discrete Applied Mathematics. 129:31-47

Schlagwörter: [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Parallel algorithms, [INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI], Applied Mathematics, 05 social sciences, parallel algorithms, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], 0508 media and communications, routing and communication in interconnection networks, Discrete Mathematics and Combinatorics, Computational and structural complexity, Parallel algorithms in computer science, computational and structural complexity, Routing and communication in interconnection networks

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://zbmath.org/1956684
https://doi.org/10.1016/s0166-218x(02)00232-9
https://inria.hal.science/hal-03764730v1/document
https://inria.hal.science/hal-03764730v1
https://doi.org/10.1016/s0166-218x(02)00232-9
https://hal.science/hal-03832690v1
https://www.sciencedirect.com/science/article/pii/S0166218X02002329
http://www.sciencedirect.com/science/article/pii/S0166218X02002329
https://dblp.uni-trier.de/db/journals/dam/dam129.html#BermondIFP03
https://hdl.handle.net/11697/23347
https://doi.org/10.1016/S0166-218X(02)00232-9

On the Ultimate Complexity of Factorials: On the ultimate complexity of factorials

Autoren: Qi Cheng

Quelle: Lecture Notes in Computer Science ISBN: 9783540006237

Schlagwörter: factorization, Analysis of algorithms and problem complexity, Analysis of algorithms, Computational and structural complexity, 0102 computer and information sciences, computational and structural complexity, 0101 mathematics, 01 natural sciences, Number-theoretic algorithms, complexity, elliptic curve, Theoretical Computer Science, Computer Science(all)

Dateibeschreibung: application/xml

Zugangs-URL: http://www.cs.ou.edu/~qcheng/paper/factorial.pdf
http://www.cs.ou.edu/~qcheng/paper/factorial.pdf
https://www.cs.ou.edu/~qcheng/paper/factorial.pdf
https://www.sciencedirect.com/science/article/pii/S0304397504004062
http://www.sciencedirect.com/science/article/pii/S0304397504004062
https://dblp.uni-trier.de/db/journals/tcs/tcs326.html#Cheng04
https://core.ac.uk/display/82632753
https://core.ac.uk/display/22676248
https://dblp.uni-trier.de/db/conf/stacs/stacs2003.html#Cheng03
https://rd.springer.com/chapter/10.1007/3-540-36494-3_15
https://doi.org/10.1007/3-540-36494-3_15
https://link.springer.com/10.1007/3-540-36494-3_15
https://link.springer.com/chapter/10.1007%2F3-540-36494-3_15

A stronger LP bound for formula size lower bounds via clique constraints

Autoren: Ueno, Kenya Kenya Ueno 上野, 賢哉

Weitere Verfasser: Ueno, Kenya Kenya Ueno 上野, 賢哉

Quelle: Theoretical Computer Science. 434:87-97

Schlagwörter: FOS: Computer and information sciences, Monotone self-dual Boolean function, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Stable set polytope, Computational Complexity (cs.CC), 01 natural sciences, Formula size lower bound, Theoretical Computer Science, Computer Science - Computational Complexity, Linear programming, Computational and structural complexity, ddc:004, Computer Science(all)

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/0902.2146
https://arxiv.org/abs/0902.2146
http://ci.nii.ac.jp/naid/120004057191
https://www.sciencedirect.com/science/article/abs/pii/S0304397512001247
https://www-imai.is.s.u-tokyo.ac.jp/~kenya/STACS2009.pdf
https://dblp.uni-trier.de/db/journals/tcs/tcs434.html#Ueno12
https://ui.adsabs.harvard.edu/abs/2009arXiv0902.2146U/abstract
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1808

THE SHUFFLING BUFFER: The shuffling buffer.

Autoren: Devillers, Olivier Guigue, Philippe

Weitere Verfasser: Devillers, Olivier Guigue, Philippe

Quelle: International Journal of Computational Geometry & Applications. 11:555-572

Schlagwörter: [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], randomized algorithms, Computer graphics, computational geometry (digital and algorithmic aspects), Randomized algorithms, 05 social sciences, computational geometry, Computational and structural complexity, 0102 computer and information sciences, 0503 education, 01 natural sciences, on-line algorithms

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://zbmath.org/2174811
https://doi.org/10.1142/s021819590100064x
https://inria.hal.science/hal-01179052v1
https://inria.hal.science/inria-00412567v1/document
https://inria.hal.science/inria-00412567v1
https://doi.org/10.1142/s021819590100064x
https://dblp.uni-trier.de/db/journals/ijcga/ijcga11.html#DevillersG01
https://www.worldscientific.com/doi/abs/10.1142/S021819590100064X
https://hal.inria.fr/inria-00412567/document
https://hal.inria.fr/hal-01179052

Extended skew partition problem

Autoren: Sulamita Klein Simone Dantas Sylvain Gravier et al.

Quelle: Discrete Mathematics. 306:2438-2449

Schlagwörter: 2-SAT, Skew partition, 0211 other engineering and technologies, Algorithms and data structures, Discrete Mathematics and Combinatorics, Computational and structural complexity, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0012365X0600330X
https://core.ac.uk/display/82541707
https://dblp.uni-trier.de/db/journals/dm/dm306.html#DantasFGK06

Asymptotic behavior of random heaps: The random binary growth model

Autoren: Mayank Sharma Chandra Nair Balaji Prabhakar

Quelle: Random Structures & Algorithms. 27:476-489

Schlagwörter: FOS: Computer and information sciences, Management decision making, including multiple objectives, Discrete Mathematics (cs.DM), Stochastic scheduling theory in operations research, Analysis of algorithms and problem complexity, sequential growth models, G.3, G.2.1, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, random walk, F.1.1, F.1.2, Classical propositional logic, posets, random Boolean functions, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), 0103 physical sciences, FOS: Mathematics, Interacting particle systems in time-dependent statistical mechanics, Sample path properties, computational and structural complexity, 0101 mathematics, probabilistic amplification, Combinatorial probability, Sums of independent random variables, random walks, Probability (math.PR), path coupling method, Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics, Gibbs measure, spin system, growth processes, Computer Science - Computational Complexity, Switching theory, application of Boolean algebra, Boolean functions, Mathematics - Probability, 60B15, locally free group, Computer Science - Discrete Mathematics

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/pdf/math/0407286
http://arxiv.org/pdf/cs/0302028
http://www.stanford.edu/~balaji/papers/05proofsof.pdf
http://arxiv.org/abs/cs/0302028
http://arxiv.org/abs/math/0407286
https://zbmath.org/2245311
https://doi.org/10.1002/rsa.20083
https://zbmath.org/2245307
https://doi.org/10.1002/rsa.20084
https://zbmath.org/2245310
https://doi.org/10.1002/rsa.20095
https://zbmath.org/2245308
https://doi.org/10.1002/rsa.20073
https://web.stanford.edu/~montanar/TEACHING/Stat375/papers/weitz1.pdf
https://www.math.ias.edu/csdm/files/04-05/dweitz_combinatorial_criteria_for_uniqueness.pdf
http://www.drorweitz.com/ac/pubs/unique_cond.pdf
http://research-information.bristol.ac.uk/en/publications/the-random-binary-growth-model(1de1bfa4-f3bd-4093-a680-d68f92b84d34)/export.html
http://onlinelibrary.wiley.com/doi/10.1002/rsa.20083/abstract
https://dl.acm.org/citation.cfm?id=1096946.1096949
https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Frsa.20083
https://dblp.uni-trier.de/db/journals/corr/corr0302.html#cs-DM-0302028
https://www.arxiv-vanity.com/papers/cs/0302028/
https://scholarship.claremont.edu/hmc_fac_pub/234/
https://arxiv.org/abs/cs/0302028
https://ui.adsabs.harvard.edu/abs/2004math......7286B/abstract
https://web.stanford.edu/~balaji/papers/05proofsof.pdf
http://onlinelibrary.wiley.com/doi/10.1002/rsa.20084/abstract
http://onlinelibrary.wiley.com/doi/10.1002/rsa.20084/full

A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints

Autoren: Ueno, Kenya Kenya Ueno

Weitere Verfasser: Ueno, Kenya Kenya Ueno

Schlagwörter: Computational and structural complexity

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1808

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.STACS.2009.1808
https://nbn-resolving.org/urn:nbn:de:0030-drops-18080
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1808

Abstracts Collection -- 25th International Symposium on Theoretical Aspects of Computer Science

Autoren: Albers, Susanne Weil, Pascal Susanne Albers and Pascal Weil

Weitere Verfasser: Albers, Susanne Weil, Pascal Susanne Albers and Pascal Weil

Schlagwörter: Symposium, theoretical computer science, algorithms and data structures, automata and formal languages, computational and structural complexity, logic in computer science, applications

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1378

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.STACS.2008.1378
https://nbn-resolving.org/urn:nbn:de:0030-drops-13780
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1378

Preface -- 25th International Symposium on Theoretical Aspects of Computer Science

Autoren: Albers, Susanne Weil, Pascal Susanne Albers and Pascal Weil

Weitere Verfasser: Albers, Susanne Weil, Pascal Susanne Albers and Pascal Weil

Schlagwörter: Symposium, theoretical computer science, algorithms and data structures, automata and formal languages, computational and structural complexity, logic in computer science, applications

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1326

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.STACS.2008.1326
https://nbn-resolving.org/urn:nbn:de:0030-drops-13263
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1326

Why almost all satisfiable $k$-CNF formulas are easy

Autoren: Coja-Oghlan, Amin Krivelevich, Michael Vilenchik, Dan et al.

Weitere Verfasser: Coja-Oghlan, Amin Krivelevich, Michael Vilenchik, Dan et al.

Quelle: ISSN: 1462-7264.

Schlagwörter: SAT, computational and structural complexity, algorithms and data structures, message passing algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]

Geographisches Schlagwort: Juan les Pins, France

Relation: hal-01184786; https://hal.inria.fr/hal-01184786; https://hal.inria.fr/hal-01184786/document; https://hal.inria.fr/hal-01184786/file/dmAH0107.pdf

Verfügbarkeit: https://hal.inria.fr/hal-01184786
https://hal.inria.fr/hal-01184786/document
https://hal.inria.fr/hal-01184786/file/dmAH0107.pdf

Mutual Information Neural-Estimation-Driven Constellation Shaping Design and Performance Analysis.

Autoren: Ji, Xiuli Wang, Qian Qian, Liping et al.

Quelle: Entropy; Apr2025, Vol. 27 Issue 4, p451, 18p

Schlagwörter: ADDITIVE white Gaussian noise, OPTICAL communications, TELECOMMUNICATION systems, DEEP learning, WIRELESS communications, ADDITIVE white Gaussian noise channels

Periodicity in tilings

Autoren: Emmanuel Jeandel Pascal Vanier The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Emmanuel Jeandel Pascal Vanier The Pennsylvania State University CiteSeerX Archives

Quelle: http://hal.archives-ouvertes.fr/docs/00/41/91/96/PDF/hal.pdf.

Schlagwörter: Computational and structural complexity, tilings, dynamical

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.401.6299

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.401.6299
http://hal.archives-ouvertes.fr/docs/00/41/91/96/PDF/hal.pdf

Periodicity in tilings

Autoren: Emmanuel Jeandel The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Emmanuel Jeandel The Pennsylvania State University CiteSeerX Archives

Quelle: http://arxiv.org/pdf/0909.3997v1.pdf.

Schlagwörter: Computational and structural complexity, tilings, dynamical

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.246.7650; http://arxiv.org/pdf/0909.3997v1.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.246.7650
http://arxiv.org/pdf/0909.3997v1.pdf

Splitting NP-Complete Sets

Autoren: Glaßer, Christian Pavan, A. Selman, Alan L. et al.

Quelle: Computer Science Faculty Publications and Presentations

Schlagwörter: computational and structural complexity, NP-complete sets, autoreducibility, mitoticity, Computer Sciences

Dateibeschreibung: application/pdf

Relation: https://scholarworks.utrgv.edu/cs_fac/148; https://scholarworks.utrgv.edu/context/cs_fac/article/1147/viewcontent/gpsz08_splitting.pdf

Verfügbarkeit: https://scholarworks.utrgv.edu/cs_fac/148
https://doi.org/10.1137/060673886
https://scholarworks.utrgv.edu/context/cs_fac/article/1147/viewcontent/gpsz08_splitting.pdf

Why almost all satisfiable $k$-CNF formulas are easy

Autoren: Amin Coja-Oghlan Michael Krivelevich Dan Vilenchik

Quelle: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AH,..., Iss Proceedings (2007)

Schlagwörter: sat, computational and structural complexity, algorithms and data structures, message passing algorithms, [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds], [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [math.math-co] mathematics [math]/combinatorics [math.co], [info.info-cg] computer science [cs]/computational geometry [cs.cg], Mathematics, QA1-939

Dateibeschreibung: electronic resource

Relation: https://dmtcs.episciences.org/3538/pdf; https://doaj.org/toc/1365-8050

Zugangs-URL: https://doaj.org/article/841e9774acef45c99216751bf95af9f7

SPLITTING NP-COMPLETE SETS

Autoren: Christian Glaߟer A. Pavan Alan L. Selman et al.

Weitere Verfasser: Christian Glaߟer A. Pavan Alan L. Selman et al.

Quelle: http://www.cs.iastate.edu/~pavan/papers/split.pdf.

Schlagwörter: Key words. computational and structural complexity, NP-complete sets, autoreducibility

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.6165; http://www.cs.iastate.edu/~pavan/papers/split.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.6165
http://www.cs.iastate.edu/~pavan/papers/split.pdf

The boolean functions computed by random boolean formulas or how to grow the right function. Random Structures and Algorithms

Autoren: Alex Brodsky The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Alex Brodsky The Pennsylvania State University CiteSeerX Archives

Quelle: http://arxiv.org/pdf/cs/0302028v1.pdf.

Schlagwörter: Computational and structural complexity, growth processes, probabilistic amplification

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.1630; http://arxiv.org/pdf/cs/0302028v1.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.1630
http://arxiv.org/pdf/cs/0302028v1.pdf

The Boolean Functions Computed by Random Boolean Formulas Or How To . . .

Autoren: Alex Brodsky Nicholas Pippenger The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Alex Brodsky Nicholas Pippenger The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cs.ubc.ca/spider/abrodsky/papers/rcf.ps.gz.

Schlagwörter: Computational and structural complexity, growth processes, probabilistic amplification

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.2617; http://www.cs.ubc.ca/spider/abrodsky/papers/rcf.ps.gz

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.2617
http://www.cs.ubc.ca/spider/abrodsky/papers/rcf.ps.gz

A Space Lower Bound for Routing in Trees

Autoren: Pierre Fraigniaud Cyril Gavoille The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Pierre Fraigniaud Cyril Gavoille The Pennsylvania State University CiteSeerX Archives

Quelle: http://dept-info.labri.fr/~gavoille/article/FG02.ps.gz.

Schlagwörter: algorithms and data structures, computational and structural complexity, compact routing

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.6649

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.6649
http://dept-info.labri.fr/~gavoille/article/FG02.ps.gz