المؤلفون: Blanc, Manon, Bournez, Olivier

المساهمون: Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Institut Polytechnique de Paris (IP Paris)

المصدر: Leibniz International Proceedings in Informatics (LIPIcs) ; International Colloquium on Automata, Languages, and Programming (ICALP) ; https://hal.science/hal-04664615 ; International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2024, Tallinn Estonia, Estonia. ⟨10.4230/LIPIcs.ICALP.2024.129⟩

مصطلحات موضوعية: Models of computation, Ordinary differential equations, Real computations, Analog computations, Complexity theory, Implicit complexity, Recursion scheme, Theory of computation → Models of computation, Theory of computation → Computability, Theory of computation → Complexity classes, Mathematics of computing → Ordinary differential equations, [INFO]Computer Science [cs]

جغرافية الموضوع: Tallinn Estonia, Estonia

Time: Tallinn Estonia, Estonia

Relation: hal-04664615; https://hal.science/hal-04664615; https://hal.science/hal-04664615/document; https://hal.science/hal-04664615/file/LIPIcs.ICALP.2024.129.pdf

الاتاحة: https://hal.science/hal-04664615
https://hal.science/hal-04664615/document
https://hal.science/hal-04664615/file/LIPIcs.ICALP.2024.129.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2024.129

المؤلفون: Capelli, Florent, Strozecki, Yann

المساهمون: Linking Dynamic Data (LINKS), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Université Paris-Saclay, Données et algorithmes pour une ville intelligente et durable - DAVID (DAVID), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), ANR-20-CE48-0004,KCODA,Compilation de connaissances pour l'analyse de données(2020)

المصدر: 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)
https://hal.science/hal-03955911
40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), Mar 2023, Hamburg, Germany. ⟨10.4230/LIPIcs.STACS.2023.18⟩

مصطلحات موضوعية: 2012 ACM Subject Classification Theory of computation → Complexity classes phrases Enumeration Polynomial Delay Incremental Delay Amortization, 2012 ACM Subject Classification Theory of computation → Complexity classes phrases Enumeration, Polynomial Delay, Incremental Delay, Amortization, Enumeration, Theory of computation → Complexity classes, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

جغرافية الموضوع: Hamburg, Germany

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2108.10208; hal-03955911; https://hal.science/hal-03955911; https://hal.science/hal-03955911/document; https://hal.science/hal-03955911/file/stacs.pdf; ARXIV: 2108.10208

الاتاحة: https://hal.science/hal-03955911
https://hal.science/hal-03955911/document
https://hal.science/hal-03955911/file/stacs.pdf
https://doi.org/10.4230/LIPIcs.STACS.2023.18

المؤلفون: Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle

مصطلحات موضوعية: Theory of computation ��� Circuit complexity, General Computer Science, Minimum Circuit Size Problem, Kolmogorov Complexity, Computer Science, Theory of computation ��� Problems, reductions and completeness, Interactive Proofs, Theory of computation ��� Complexity classes, Worst-Case to Average-Case Reductions, Theoretical Computer Science

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::811370386e56ef5b730787d6b31caafb

المؤلفون: Kim, Hyoseok, Watel, Dimitri, Faye, Alain, Cédric, Hervet

المساهمون: Kardinal, CEDRIC. Optimisation Combinatoire (CEDRIC - OC), Centre d'études et de recherche en informatique et communications (CEDRIC), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers CNAM (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers CNAM (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM), Institut Polytechnique de Paris (IP Paris), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom Paris (IMT)-Télécom SudParis (TSP), Statistiques, Optimisation, Probabilités (SOP - SAMOVAR), Institut Mines-Télécom Paris (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom Paris (IMT)-Télécom SudParis (TSP), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)

المصدر: https://hal.science/hal-04143445 ; 2023.

مصطلحات موضوعية: data-driven wasserstein distributionally robust optimization, optimization under uncertainty, computational complexity, approximability, 2012 ACM Subject Classification Theory of computation → Complexity classes, Mathematics of computing → Combinatorial optimization, Theory of computation → Approximation algorithms analysis phrases distributionally robust optimization, 2012 ACM Subject Classification Theory of computation → Complexity classes Mathematics of computing → Combinatorial optimization Theory of computation → Approximation algorithms analysis phrases distributionally robust optimization, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Relation: hal-04143445; https://hal.science/hal-04143445; https://hal.science/hal-04143445/document; https://hal.science/hal-04143445/file/01_STACS_2022_HAL.pdf

الاتاحة: https://hal.science/hal-04143445
https://hal.science/hal-04143445/document
https://hal.science/hal-04143445/file/01_STACS_2022_HAL.pdf
https://doi.org/10.4230/LIPIcs.CVIT.2016.23

المؤلفون: Fournier, Hervé, Malod, Guillaume, Szusterman, Maud, Tavenas, Sébastien

المساهمون: Institut de Mathématiques de Jussieu - Paris Rive Gauche (IMJ-PRG (UMR_7586)), Université Pierre et Marie Curie - Paris 6 (UPMC)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Mathématiques (LAMA), Université Savoie Mont Blanc (USMB Université de Savoie Université de Chambéry )-Centre National de la Recherche Scientifique (CNRS), Université Savoie Mont Blanc (USMB Université de Savoie Université de Chambéry ), Centre National de la Recherche Scientifique (CNRS)

المصدر: Leibniz International Proceedings in Informatics (LIPIcs). doi:10.4230/LIPIcs.FSTTCS.2019.15 ; FSTTCS ; https://hal.science/hal-02404630 ; FSTTCS, Dec 2019, Mumbai, India. pp.15:1--15:14, ⟨10.4230/LIPIcs.FSTTCS.2019.15⟩

مصطلحات موضوعية: Elementary symmetric polynomials, Lower bounds, Theory of computation → Algebraic complexity theory, Theory of computation → Complexity classes, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

جغرافية الموضوع: Mumbai, India

الاتاحة: https://hal.science/hal-02404630
https://hal.science/hal-02404630v1/document
https://hal.science/hal-02404630v1/file/monotone.pdf
https://doi.org/10.4230/LIPIcs.FSTTCS.2019.15

المؤلفون: Allender, Eric, Chauhan, Archit, Datta, Samir

المصدر: Acta Informatica. 59:289-319

مصطلحات موضوعية: Computer Networks and Communications, Theory of computation → Parallel algorithms, Parallel Algorithms, Space-Bounded Complexity Classes, Depth-First Search, Planar Digraphs, Theory of computation → Complexity classes, Software, Information Systems

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71cc1a4ef2c11b520763a9bfde80fc9a
https://doi.org/10.1007/s00236-022-00425-1

المؤلفون: Allender, Eric, Hirahara, Shuichi, Tirumala, Harsha

مصطلحات موضوعية: Kolmogorov Complexity, Interactive Proofs, Theory of computation → Complexity classes, Theory of computation → Circuit complexity

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::d451dd83a47a4ddda71e5f4c4ebf5e8b

المؤلفون: Jin, Yujia, Muthukumar, Vidya, Sidford, Aaron

مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science::Computer Science and Game Theory, ComputingMilieux_PERSONALCOMPUTING, Computational Complexity (cs.CC), Nash equilibrium, Computer Science - Computational Complexity, general-sum games, Optimization and Control (math.OC), Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), stochastic games, complexity, Mathematics - Optimization and Control, Theory of computation → Complexity classes, Computer Science and Game Theory (cs.GT)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc5c771593f98641a516caeafe63a6ff

المؤلفون: Aichinger, Erhard, Grünbacher, Simon

مصطلحات موضوعية: conditional identities, quasi-identities, Mathematics of computing → Combinatorial algorithms, systems of equations, Theory of computation → Complexity classes

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::ac0fa27a220847a4d2d78bfc5ab80799

المؤلفون: Brotcorne, Luce, Buchheim, Christoph, den Hertog, Dick, Henke, Dorothee

مصطلحات موضوعية: bilevel optimization, computational complexity, robust optimization, algorithmics, stochastic optimization, Theory of computation → Complexity theory and logic, Theory of computation → Mathematical optimization, Theory of computation → Complexity classes

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::ffca2bf9b14e77a3c493a2bd6685bf02

المؤلفون: Girish, Uma, Raz, Ran, Zhan, Wei

مصطلحات موضوعية: Theory of computation → Interactive proof systems, BPL, Theory of computation → Pseudorandomness and derandomization, Verifiable, ZPP, ZPL, Untrusted, BPP, Theory of computation → Complexity classes, Randomness

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::b0b08a01d1916513be653354254e3711

المؤلفون: Vyas, Nikhil, Williams, Ryan

مصطلحات موضوعية: exponential hierarchy, missing string, relativization, Theory of computation → Complexity classes, circuit complexity, oracles, Theory of computation → Circuit complexity

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::39dac4241244674cf0f804666282b1b2

المؤلفون: Goldreich, Oded, Rothblum, Guy N., Skverer, Tal

مصطلحات موضوعية: Theory of computation → Interactive proof systems, Interactive Proofs, Proof-Oblivious Queries, Theory of computation → Complexity classes, Complexity Theory, Interactive Proofs of Proximity, Property Testing

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::3be700c0f7b7b4ca2444f1799b381426

المؤلفون: Bourneuf, Romain, Folwarczný, Lukáš, Hubáček, Pavel, Rosen, Alon, Schwartzbach, Nikolaj I.

المصدر: Bourneuf, R, Folwarczný, L, Hubáček, P, Rosen, A & Schwartzbach, N I 2023, PPP-Completeness and Extremal Combinatorics . i 14th Conference on Innovations in Theoretical Computer Science . s. 1-20 . https://doi.org/10.4230/LIPIcs.ITCS.2023.22

مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Computational Complexity, total search problems, FOS: Mathematics, Theory of computation → Problems, reductions and completeness, Mathematics - Combinatorics, extremal combinatorics, PPP-completeness, Combinatorics (math.CO), Computational Complexity (cs.CC), Theory of computation → Complexity classes

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2a53dae3ec07852141eaf0188ba94035

المؤلفون: Santhanam, Rahul

مصطلحات موضوعية: uniform lower bounds, Probabilistic Kolmogorov complexity, sampling algorithms, Theory of computation → Complexity classes, Theory of computation → Circuit complexity

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::333700019d646edbb957ddce50e7f0ea

المؤلفون: Pasarkar, Amol, Papadimitriou, Christos, Yannakakis, Mihalis

مصطلحات موضوعية: FOS: Computer and information sciences, Extremal Combinatorics, Computer Science - Computational Complexity, Total Complexity, FOS: Mathematics, Pigeonhole Principle, Mathematics - Combinatorics, Combinatorics (math.CO), Computational Complexity (cs.CC), Theory of computation → Complexity classes

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93ff33f6087e763477695cb7379537ef
http://arxiv.org/abs/2209.07625

المؤلفون: Chen, Lijie, Hirahara, Shuichi, Vafa, Neekon

مصطلحات موضوعية: Average-case complexity, Theory of computation ��� Complexity classes, worst-case to average-case reduction

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::dd15a175c295ee9ded124fe4c27117ae

المؤلفون: Gharibian, Sevag, Rudolph, Dorian

مصطلحات موضوعية: FOS: Computer and information sciences, Quantum Merlin Arthur (QMA), Computer Science - Computational Complexity, Quantum Physics, oracle complexity class, FOS: Physical sciences, quantum complexity theory, Computational Complexity (cs.CC), Quantum Physics (quant-ph), admissible weighting function, Theory of computation → Quantum complexity theory, Theory of computation → Complexity classes, simulation of local measurement

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a029d05581e51abbfbb596eb19660fc5

المؤلفون: Hirahara, S, Santhanam, R

المساهمون: Braverman, M

مصطلحات موضوعية: Theory of computation ��� Interactive proof systems, average-case complexity, instance checker, Theory of computation ��� Pseudorandomness and derandomization, pseudorandomness, Theory of computation ��� Complexity classes

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13a53f41a63c60a4a06dc35ab5a0ef76

المؤلفون: Fernau, Henning, Haase, Carolina, Hoffmann, Stefan

مصطلحات موضوعية: TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Synchronization of finite automata, computational complexity, Nonlinear Sciences::Cellular Automata and Lattice Gases, Theory of computation → Regular languages, Theory of computation → Complexity classes, Computer Science::Formal Languages and Automata Theory

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::ab11e528312c6ad9c2df946111263e70