Finer-grained reductions in fine-grained hardness of approximation

Συγγραφείς: Elie Abboud, Noga Ron-Zewi

Συνεισφορές: Elie Abboud and Noga Ron-Zewi

Πηγή: Theoretical Computer Science. 1026:114976

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2311.00798
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.7

The Power of Self-Reducibility: Selectivity, Information, and Approximation

Συγγραφείς: Hemaspaandra, Lane A.^Aff10

Συνεισφορές: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Woeginger, Gerhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Du, Ding-Zhu, editor^Aff8, Wang, Jie, editor^Aff9

Πηγή: Complexity and Approximation : In Memory of Ker-I Ko. 12000:19-47

Deadlock prevention by acyclic orientations

Συγγραφείς: Bermond, Jean-Claude, Ianni, Miriam Di, Flammini, Michele, Pérennès, Stéphane

Συνεισφορές: Bermond, Jean-Claude

Πηγή: Discrete Applied Mathematics. 129:31-47

Θεματικοί όροι: [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

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Qi Cheng

Πηγή: Lecture Notes in Computer Science ISBN: 9783540006237

Θεματικοί όροι: 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)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Ueno, Kenya

Συνεισφορές: Kenya Ueno, 上野, 賢哉

Πηγή: Theoretical Computer Science. 434:87-97

Θεματικοί όροι: 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)

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

Periodicity in Tilings

Συγγραφείς: Jeandel, Emmanuel^Aff17, Vanier, Pascal^Aff17

Συνεισφορές: Hutchison, David, editor^Aff1, Kanade, Takeo, editor^Aff2, Kittler, Josef, editor^Aff3, Kleinberg, Jon M., editor^Aff4, Mattern, Friedemann, editor^Aff5, Mitchell, John C., editor^Aff6, Naor, Moni, editor^Aff7, Nierstrasz, Oscar, editor^Aff8, Pandu Rangan, C., editor^Aff9, Steffen, Bernhard, editor^Aff10, Sudan, Madhu, editor^Aff11, Terzopoulos, Demetri, editor^Aff12, Tygar, Doug, editor^Aff13, Vardi, Moshe Y., editor^Aff14, Weikum, Gerhard, editor^Aff15, Gao, Yuan, editor^Aff16, Lu, Hanlin, editor^Aff16, Seki, Shinnosuke, editor^Aff16, Yu, Sheng, editor^Aff16

Πηγή: Developments in Language Theory : 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings. 6224:243-254

On the Black-Box Complexity of Sperner’s Lemma

Συγγραφείς: Friedl, Katalin^Aff18, Ivanyos, Gábor^Aff19, Santha, Miklos^Aff20, Verhoeven, Yves F.^{Aff20, Aff21}

Συνεισφορές: Hutchison, David, editor^Aff1, Kanade, Takeo, editor^Aff2, Kittler, Josef, editor^Aff3, Kleinberg, Jon M., editor^Aff4, Mattern, Friedemann, editor^Aff5, Mitchell, John C., editor^Aff6, Naor, Moni, editor^Aff7, Nierstrasz, Oscar, editor^Aff8, Pandu Rangan, C., editor^Aff9, Steffen, Bernhard, editor^Aff10, Sudan, Madhu, editor^Aff11, Terzopoulos, Demetri, editor^Aff12, Tygar, Dough, editor^Aff13, Vardi, Moshe Y., editor^Aff14, Weikum, Gerhard, editor^Aff15, Liśkiewicz, Maciej, editor^Aff16, Reischuk, Rüdiger, editor^Aff17

Πηγή: Fundamentals of Computation Theory : 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005. Proceedings. 3623:245-257

THE SHUFFLING BUFFER: The shuffling buffer.

Συγγραφείς: Devillers, Olivier, Guigue, Philippe

Συνεισφορές: Devillers, Olivier

Πηγή: International Journal of Computational Geometry & Applications. 11:555-572

Θεματικοί όροι: [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

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: 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

Strong Reductions and Immunity for Exponential Time

Συγγραφείς: Schaefer, Marcus^Aff6, Stephan, Frank^Aff7

Συνεισφορές: Goos, Gerhard, editor^Aff1, Hartmanis, Juris, editor^Aff2, van Leeuwen, Jan, editor^Aff3, Alt, Helmut, editor^Aff4, Habib, Michel, editor^Aff5

Πηγή: STACS 2003 : 20th Annual Symposium on Theoretical Aspects of Computer Science Berlin, Germany, February 27 – March 1, 2003 Proceedings. 2607:559-570

A Space Lower Bound for Routing in Trees

Συγγραφείς: Fraigniaud, Pierre^Aff6, Gavoille, Cyril^Aff7

Συνεισφορές: Goos, Gerhard, editor^Aff1, Hartmanis, Juris, editor^Aff2, van Leeuwen, Jan, editor^Aff3, Alt, Helmut, editor^Aff4, Ferreira, Afonso, editor^Aff5

Πηγή: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science Antibes - Juan les Pins, France, March 14–16, 2002 Proceedings. 2285:65-75

Efficient Minimal Perfect Hashing in Nearly Minimal Space

Συγγραφείς: Hagerup, Torben^Aff6, Tholey, Torsten^Aff6

Συνεισφορές: Goos, Gerhard, editor^Aff1, Hartmanis, Juris, editor^Aff2, van Leeuwen, Jan, editor^Aff3, Ferreira, Afonso, editor^Aff4, Reichel, Horst, editor^Aff5

Πηγή: STACS 2001 : 18th Annual Symposium on Theoretical Aspects of Computer Science Dresden, Germany, February 15–17, 2001 Proceedings. 2010:317-326

If P ≠ NP then Some Strongly Noninvertible Functions Are Invertible

Συγγραφείς: Hemaspaandra, Lane A.^Aff5, Pasanen, Kari^Aff6, Rothe, Jörg^Aff7

Συνεισφορές: Goos, Gerhard, editor^Aff1, Hartmanis, Juris, editor^Aff2, van Leeuwen, Jan, editor^Aff3, Freivalds, Rūsiņš, editor^Aff4

Πηγή: Fundamentals of Computation Theory : 13th International Symposium, FCT 2001 Riga, Latvia, August 22–24, 2001 Proceedings. 2138:162-171

Nearly optimal language compression using extractors

Συγγραφείς: Fortnow, Lance^Aff1, Laplante, Sophie^Aff2

Συνεισφορές: Goos, G., editor, Hartmanis, J., editor, van Leeuwen, J., editor, Morvan, Michel, editor, Meinel, Christoph, editor, Krob, Daniel, editor

Πηγή: STACS 98 : 15th Annual Symposium on Theoretical Aspects of Computer Science Paris, France, February 25–27, 1998 Proceedings. 1373:84-93

Extended skew partition problem

Συγγραφείς: Sulamita Klein, Simone Dantas, Sylvain Gravier, Celina M. H. de Figueiredo

Πηγή: Discrete Mathematics. 306:2438-2449

Θεματικοί όροι: 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

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Mayank Sharma, Chandra Nair, Balaji Prabhakar

Πηγή: Random Structures & Algorithms. 27:476-489

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Acyclic orientations for deadlock prevention in interconnection networks : extended abstract

Συγγραφείς: Bermond, Jean-Claude^Aff1, Di Ianni, Miriam^Aff2, Flammini, Michele^{Aff3, Aff1}, Perennes, Stephane^{Aff4, Aff1}

Συνεισφορές: Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Möhring, Rolf H., editor

Πηγή: Graph-Theoretic Concepts in Computer Science : 23rd International Workshop, WG'97 Berlin, Germany, June 18–20, 1997 Proceedings. 1335:52-64

Communication complexity and sequential computation

Συγγραφείς: Hromkovič, Juraj^Aff1, Schnitger, Georg^Aff2

Συνεισφορές: Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Prívara, Igor, editor, Ružička, Peter, editor

Πηγή: Mathematical Foundations of Computer Science 1997 : 22nd International Symposium, MFCS '97 Bratislava, Slovakia, August 25–29, 1997 Proceedings. 1295:71-84

An unambiguous class possessing a complete set

Συγγραφείς: Lange, Klaus-Jörn^Aff1

Συνεισφορές: Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Reischuk, Rüdiger, editor, Morvan, Michel, editor

Πηγή: STACS 97 : 14th Annual Symposium on Theoretical Aspects of Computer Science Lübeck, Germany February 27–March 1, 1997 Proceedings. 1200:339-350

Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations

Συγγραφείς: Ďuriš, Pavol^Aff1, Hromkovič, Juraj^Aff2, Rolim, José D. P.^Aff3, Schnitger, Georg^Aff4

Συνεισφορές: Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Reischuk, Rüdiger, editor, Morvan, Michel, editor

Πηγή: STACS 97 : 14th Annual Symposium on Theoretical Aspects of Computer Science Lübeck, Germany February 27–March 1, 1997 Proceedings. 1200:117-128

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

Συγγραφείς: Ueno, Kenya

Συνεισφορές: Kenya Ueno

Θεματικοί όροι: Computational and structural complexity

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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