Search Results - "name=Algorithms and Complexity"

Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler–Leman

Authors: de Rezende, Susanna F. Fleming, Noah Janett, Duri Andrea et al.

Source: de Rezende, S F, Fleming, N, Janett, D A, Nordström, J & Pang, S 2025, Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler–Leman. in STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Proceedings of the annual ACM Symposium on Theory of Computing, Association for Computing Machinery (ACM), pp. 1371-1382. https://doi.org/10.48550/ARXIV.2411.14267, https://doi.org/10.1145/3717823.3718271

Subject Terms: Supercritical Trade-off, Resolution, Weisfeiler-Leman, Graph Isomorphism, /dk/atira/pure/core/keywords/algorithms_and_complexity, name=Algorithms and Complexity

Relation: urn:ISBN:9798400715105

Availability: https://hdl.handle.net/1983/a8bf31c1-4259-4643-988c-281b167b1711
https://research-information.bris.ac.uk/en/publications/a8bf31c1-4259-4643-988c-281b167b1711
https://doi.org/10.48550/ARXIV.2411.14267

Instability of backoff protocols with arbitrary arrival rates

Authors: Goldberg, Leslie Ann Lapinskas, John A

Source: Goldberg, L A & Lapinskas, J A 2025, 'Instability of backoff protocols with arbitrary arrival rates', Journal of Computer and System Sciences. https://doi.org/10.48550/arXiv.2203.17144, https://doi.org/10.1016/j.jcss.2025.103638

Subject Terms: /dk/atira/pure/core/keywords/algorithms_and_complexity, name=Algorithms and Complexity

Availability: https://hdl.handle.net/1983/ebed6a8f-cd5b-40db-aa97-ab333fd98bbc
https://research-information.bris.ac.uk/en/publications/ebed6a8f-cd5b-40db-aa97-ab333fd98bbc
https://doi.org/10.48550/arXiv.2203.17144

Theory as a source of software and system requirements

Authors: Ruzanna Chitchyan Caroline Bird

Source: Chitchyan, R & Bird, C M 2022, 'Theory as a Source of Software and System Requirements', Requirements Engineering, vol. 27, no. 3, pp. 375-398. https://doi.org/10.1007/s00766-022-00380-w

Subject Terms: name=Algorithms and Complexity, requirements elicitation, Case study, name=Bristol Interaction Group, 0211 other engineering and technologies, 02 engineering and technology, Energy service, Energy transition, 0202 electrical engineering, electronic engineering, information engineering, Systemic concerns, name=Cabot Institute Low Carbon Energy Research, requirements, system of systems, elicitation method, Tacit knowledge, Demand-side response, energy transition, Grounded Theory, Systemic concerns, Tacit knowledge, smart energy, energy service

File Description: application/pdf

Access URL: https://research-information.bris.ac.uk/ws/files/324486522/Chitchyan_Bird2022_Article_TheoryAsASourceOfSoftwareAndSy.pdf
https://hdl.handle.net/1983/45eaa6ac-85c7-4af4-97e2-19f2266736ff

(De)troubling transparency: artificial intelligence (AI) for clinical applications

Authors: Peter David Winter Annamaria Carusi

Source: Med Humanit
Winter, P & Carusi, A 2022, '(De)troubling transparency : artificial intelligence (AI) for clinical applications', Medical Humanities. https://doi.org/10.1136/medhum-2021-012318

Subject Terms: 0301 basic medicine, name=Algorithms and Complexity, name=Health and Wellbeing, 3. Good health, 03 medical and health sciences, 0302 clinical medicine, Artificial Intelligence, Physicians, Humans, Original Research

File Description: application/pdf

Access URL: https://pubmed.ncbi.nlm.nih.gov/35545432
https://research-information.bris.ac.uk/en/publications/b69f3e05-6881-4ff6-878f-387da2869666
https://hdl.handle.net/1983/b69f3e05-6881-4ff6-878f-387da2869666

Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs II

Authors: Komjathy, Julia Lapinskas, John A Lengler, Johannes et al.

Source: Komjathy, J, Lapinskas, J A, Lengler, J & Schaller, U 2024, 'Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs II', Electronic Journal of Probability. < https://arxiv.org/abs/2309.11880 >

Subject Terms: /dk/atira/pure/core/keywords/algorithms_and_complexity, name=Algorithms and Complexity

Availability: https://hdl.handle.net/1983/658219bf-cbea-4abd-aad8-db7f2c7c698c
https://research-information.bris.ac.uk/en/publications/658219bf-cbea-4abd-aad8-db7f2c7c698c
https://arxiv.org/abs/2309.11880

Faster exponential-time algorithms for approximately counting independent sets

Authors: Leslie Ann Goldberg John Lapinskas David Richerby

Source: Theoretical Computer Science. 892:48-84

Subject Terms: FOS: Computer and information sciences, name=Algorithms and Complexity, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

File Description: text

Access URL: http://arxiv.org/pdf/2005.05070
http://arxiv.org/abs/2005.05070
https://ora.ox.ac.uk/objects/uuid:19636bf4-53c3-4e14-ad9b-aa80525a7db8
http://repository.essex.ac.uk/id/eprint/31227
https://doi.org/10.1016/j.tcs.2021.09.009
https://dblp.uni-trier.de/db/journals/corr/corr2005.html#abs-2005-05070
https://www.sciencedirect.com/science/article/pii/S0304397521005235
https://research-information.bris.ac.uk/en/publications/faster-exponential-time-algorithms-for-approximately-counting-ind

Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle

Authors: Dell, Holger Lapinskas, John Meeks, Kitty et al.

Contributors: Dell, Holger Lapinskas, John Meeks, Kitty et al.

Source: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ISBN: 9781611975994
ACM-SIAM Symposium on Discrete Algorithms (SODA20)
Dell, H, Lapinskas, J & Meeks, K 2022, 'Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle', S I A M Journal on Computing, vol. 51, no. 4, pp. 849-899. https://doi.org/10.1137/19M130604X
Dell, H, Lapinskas, J & Meeks, K 2020, Approximately counting and sampling small witnesses using a colourful decision oracle. in S Chawla (ed.), Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp. 2201-2211. https://doi.org/10.1137/1.9781611975994.135

Subject Terms: oracle access, FOS: Computer and information sciences, name=Algorithms and Complexity, k-hypergraphs, 0102 computer and information sciences, uniform edge sampling, Computational Complexity (cs.CC), colourful independence oracle, 01 natural sciences, Computer Science - Computational Complexity, sampling algorithms, fine-grained complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), k-hypergraph, approximate counting

File Description: application/pdf

Access URL: https://epubs.siam.org/doi/pdf/10.1137/1.9781611975994.135
http://arxiv.org/abs/1907.04826
https://eprints.gla.ac.uk/262642/2/262642.pdf
https://eprints.gla.ac.uk/202030/7/202030.pdf
https://ui.adsabs.harvard.edu/abs/2019arXiv190704826D/abstract
https://research-information.bris.ac.uk/en/publications/approximately-counting-and-sampling-small-witnesses-using-a-colou
https://www.arxiv-vanity.com/papers/1907.04826/
https://dblp.uni-trier.de/db/journals/corr/corr1907.html#abs-1907-04826
http://eprints.gla.ac.uk/202030/
https://arxiv.org/abs/1907.04826
https://pure.itu.dk/portal/da/publications/4b051a07-c184-4915-aca3-b1bb154ece01
https://pure.itu.dk/ws/files/85551356/1907.04826.pdf

A Fixed-Parameter Perspective on #BIS

Authors: Curticapean, R Dell, H Fomin, F et al.

Contributors: Curticapean, R Dell, H Fomin, F et al.

Source: Curticapean, R, Dell, H, Fomin, F, Goldberg, L A & Lapinskas, J A 2019, ' A fixed-parameter perspective on #BIS ', Algorithmica, vol. 81, no. 10, pp. 3844-3864 . https://doi.org/10.1007/s00453-019-00606-4
Curticapean, R-C, Dell, H, Fomin, F, Goldberg, L A & Lapinskas, J 2019, 'A Fixed-Parameter Perspective on #BIS', Algorithmica, vol. 81, no. 10, pp. 3844–3864. https://doi.org/10.1007/s00453-019-00606-4
Algorithmica

Subject Terms: FOS: Computer and information sciences, name=Algorithms and Complexity, G.2.1, G.2.2, 0102 computer and information sciences, Computational Complexity (cs.CC), F.2.2, 01 natural sciences, Computer Science - Computational Complexity, independent sets, Approximate counting, parameterised complexity, Independent sets, Parameterised complexity, ddc:004, 0101 mathematics

File Description: application/pdf

Access URL: https://link.springer.com/content/pdf/10.1007/s00453-019-00606-4.pdf
http://arxiv.org/abs/1702.05543
https://arxiv.org/abs/1702.05543
http://ui.adsabs.harvard.edu/abs/2017arXiv170205543C/abstract
https://arxiv.org/pdf/1702.05543.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.13
https://research-information.bris.ac.uk/en/publications/ecb5c34c-d6be-44ec-97ea-080f57c5e6af
https://hdl.handle.net/1983/ecb5c34c-d6be-44ec-97ea-080f57c5e6af
https://pure.itu.dk/ws/files/84707589/1702.05543.pdf
https://hdl.handle.net/1956/21835

Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I

Authors: Komjathy, Julia Lapinskas, John A Lengler, Johannes et al.

Subject Terms: Social and Information Networks (cs.SI), FOS: Computer and information sciences, name=Algorithms and Complexity, Probability (math.PR), Populations and Evolution (q-bio.PE), Computer Science - Social and Information Networks, FOS: Biological sciences, FOS: Mathematics, Mathematics - Combinatorics, 05C82, 60K35, 60K50, 82B43, 91D30, 91D25, Combinatorics (math.CO), Quantitative Biology - Populations and Evolution, Mathematics - Probability

Access URL: http://arxiv.org/abs/2309.11840

IoT Key Exchange Performance Analysis

Authors: Raimondo, Francesco Erol, Ufuk Gunner, Sam D et al.

Source: Raimondo, F, Erol, U, Gunner, S D, Pope, J, Zakrzewski, R, Faulks, M, McConville, R, Pasquier, T, Piechocki, R J & Oikonomou, G 2022, 'IoT Key Exchange Performance Analysis', Paper presented at Unconventional Security for Wireless Communications, Linz, Austria, 3/10/22. < https://ewsn2022.pro2future.at/paper/ws+tut/uswc2022-final1.pdf >

Subject Terms: /dk/atira/pure/core/keywords/cyber_security, name=Cyber Security, /dk/atira/pure/core/keywords/algorithms_and_complexity, name=Algorithms and Complexity, Internet of Things (IoT), ECC, Key Exchange, Key agreement, Energy consumption analysis

Availability: https://hdl.handle.net/1983/13d38fc6-2125-4277-8c56-2c5e1add1d1c
https://research-information.bris.ac.uk/en/publications/13d38fc6-2125-4277-8c56-2c5e1add1d1c
https://ewsn2022.pro2future.at/paper/ws+tut/uswc2022-final1.pdf

Fine-Grained Reductions from Approximate Counting to Decision

Authors: Dell, Holger Lapinskas, John

Source: Dell, H & Lapinskas, J 2021, 'Fine-Grained Reductions from Approximate Counting to Decision', ACM Transactions on Computation Theory, vol. 13, no. 2, 8, pp. 1-24. https://doi.org/10.1145/3442352

Subject Terms: FOS: Computer and information sciences, name=Algorithms and Complexity, Fine-grained complexity, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Satisfiability, Approximate Counting

File Description: application/pdf

Access URL: https://ora.ox.ac.uk/objects/uuid:46e63536-2f78-4aeb-bf3f-19144809e770/download_file?safe_filename=approximation-to-decision.pdf&file_format=application%2Fpdf&type_of_work=Conference+item
http://arxiv.org/abs/1707.04609
https://arxiv.org/abs/1707.04609
https://arxiv.org/pdf/1707.04609.pdf
https://research-information.bris.ac.uk/en/publications/fine-grained-reductions-from-approximate-counting-to-decision-2
https://doi.org/10.1145/3442352
https://dl.acm.org/doi/10.1145/3442352
https://ora.ox.ac.uk/objects/uuid:46e63536-2f78-4aeb-bf3f-19144809e770
https://doi.org/10.1145/3188745.3188920
https://pure.itu.dk/portal/da/publications/2f308edc-1bf7-4546-9917-3ad656594f47

Phase transitions of the Moran process and algorithmic consequences

Authors: Goldberg, L Lapinskas, J Richerby, D

Source: Random Structures & Algorithms. 56:597-647

Subject Terms: Social and Information Networks (cs.SI), FOS: Computer and information sciences, name=Algorithms and Complexity, absorption time, Discrete Mathematics (cs.DM), Probability (math.PR), Populations and Evolution (q-bio.PE), Computer Science - Social and Information Networks, 0102 computer and information sciences, 01 natural sciences, fixation probability, FOS: Biological sciences, Moran process, FOS: Mathematics, evolutionary dynamics, Mathematics - Combinatorics, Combinatorics (math.CO), Quantitative Biology - Populations and Evolution, Mathematics - Probability, Computer Science - Discrete Mathematics

File Description: text

Access URL: http://repository.essex.ac.uk/26438/1/1804.02293.pdf
http://arxiv.org/abs/1804.02293
https://jglobal.jst.go.jp/en/detail?JGLOBAL_ID=202002263449813655
https://onlinelibrary.wiley.com/doi/10.1002/rsa.20890
https://dblp.uni-trier.de/db/journals/corr/corr1804.html#abs-1804-02293

Asymptotically optimal amplifiers for the Moran process

Authors: Leslie Ann Goldberg John Lapinskas Johannes Lengler et al.

Source: Theoretical Computer Science

Subject Terms: Social and Information Networks (cs.SI), FOS: Computer and information sciences, 0301 basic medicine, name=Algorithms and Complexity, Discrete Mathematics (cs.DM), Probability (math.PR), Populations and Evolution (q-bio.PE), Computer Science - Social and Information Networks, 0102 computer and information sciences, 01 natural sciences, 03 medical and health sciences, FOS: Biological sciences, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Quantitative Biology - Populations and Evolution, Mathematics - Probability, Computer Science - Discrete Mathematics

Access URL: https://arxiv.org/pdf/1611.04209
http://arxiv.org/abs/1611.04209
https://research-information.bris.ac.uk/en/publications/asymptotically-optimal-amplifiers-for-the-moran-process
https://www.research-collection.ethz.ch/handle/20.500.11850/313268
https://dblp.uni-trier.de/db/journals/corr/corr1611.html#GoldbergLLMPP16
https://www.sciencedirect.com/science/article/pii/S0304397518305218
https://ui.adsabs.harvard.edu/abs/2016arXiv161104209G/abstract

‘If You’re Going to Trust the Machine, Then That Trust Has Got to Be Based on Something’:Validation and the Co-Constitution of Trust in Developing Artificial Intelligence (AI) for the Early Diagnosis of Pulmonary Hypertension (PH)

Authors: Winter, Peter Carusi, Annamaria

Source: Winter, P & Carusi, A 2022, '‘If You’re Going to Trust the Machine, Then That Trust Has Got to Be Based on Something’ : Validation and the Co-Constitution of Trust in Developing Artificial Intelligence (AI) for the Early Diagnosis of Pulmonary Hypertension (PH)', Science & Technology Studies, vol. 35, no. 4, pp. 58-77. https://doi.org/10.23987/sts.102198

Subject Terms: /dk/atira/pure/core/keywords/health_science_and_technology, name=Health and Wellbeing, /dk/atira/pure/core/keywords/algorithms_and_complexity, name=Algorithms and Complexity

File Description: application/pdf

Availability: https://hdl.handle.net/1983/325bf98c-9c22-41ce-b875-2f439eebc1fe
https://research-information.bris.ac.uk/en/publications/325bf98c-9c22-41ce-b875-2f439eebc1fe
https://doi.org/10.23987/sts.102198
https://research-information.bris.ac.uk/ws/files/325074313/Full_text_PDF_final_published_version_.pdf

Amplifiers for the Moran Process

Authors: Andreas Galanis Andreas Göbel Leslie Ann Goldberg et al.

Contributors: Andreas Galanis Andreas Göbel Leslie Ann Goldberg et al.

Source: Galanis, A, Göbel, A, Goldberg, L A, Lapinskas, J A & Richerby, D 2017, 'Amplifiers for the Moran process', Journal of the ACM, vol. 64, no. 1, pp. 1. https://doi.org/10.1145/3019609

Subject Terms: Social and Information Networks (cs.SI), FOS: Computer and information sciences, name=Algorithms and Complexity, Discrete Mathematics (cs.DM), Probability (math.PR), Populations and Evolution (q-bio.PE), Computer Science - Social and Information Networks, randomised algorithm on graphs, 0102 computer and information sciences, 16. Peace & justice, 01 natural sciences, FOS: Biological sciences, Moran process, FOS: Mathematics, evolutionary dynamics, ddc:004, Quantitative Biology - Populations and Evolution, Mathematics - Probability, Computer Science - Discrete Mathematics

File Description: application/pdf; text

Access URL: https://drops.dagstuhl.de/opus/volltexte/2016/6222/pdf/LIPIcs-ICALP-2016-62.pdf
http://arxiv.org/abs/1512.05632
https://dl.acm.org/doi/10.1145/3019609
https://dblp.uni-trier.de/db/journals/jacm/jacm64.html#Galanis0GLR17
https://research-information.bris.ac.uk/ws/files/206843134/Full_text_PDF_accepted_author_manuscript_.pdf
https://doi.org/10.1145/3019609
https://research-information.bris.ac.uk/en/publications/amplifiers-for-the-moran-process
https://dl.acm.org/citation.cfm?id=3019609
https://ora.ox.ac.uk/objects/uuid:370cb1f4-d133-4f1b-bc14-66c4af4bc550
https://doi.org/10.4230/lipics.icalp.2016.62
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.62
https://hdl.handle.net/1983/59a1e9ce-6840-43c3-95f3-5b7a3904e9f6
https://research-information.bris.ac.uk/en/publications/59a1e9ce-6840-43c3-95f3-5b7a3904e9f6

SOS Lower Bound for Exact Planted Clique

Authors: Pang, Shuo

Source: Pang, S 2021, SOS Lower Bound for Exact Planted Clique. in 36th Computational Complexity Conference (CCC)., 26, Leibniz International Proceedings in Informatics, vol. 200, 36th Computational Complexity Conference, Toronto, Ontario, Canada, 20/07/21. https://doi.org/10.4230/LIPICS.CCC.2021.26

Subject Terms: k-Clique, Sum-of-Squares, Average-case Lower Bounds, /dk/atira/pure/core/keywords/algorithms_and_complexity, name=Algorithms and Complexity

Relation: urn:ISBN:9783959771931

Availability: https://hdl.handle.net/1983/d25380a0-d74e-428a-87b2-73803749c8b1
https://research-information.bris.ac.uk/en/publications/d25380a0-d74e-428a-87b2-73803749c8b1
https://doi.org/10.4230/LIPICS.CCC.2021.26
https://computationalcomplexity.org/Archive/2021/fullsite/

Exploring high-frequency eddy-current testing for sub-aperture defect characterisation using parametric-manifold mapping

Authors: Hughes, Robert R Drinkwater, Bruce W

Source: Hughes, R R & Drinkwater, B W 2021, 'Exploring high-frequency eddy-current testing for sub-aperture defect characterisation using parametric-manifold mapping', NDT and E International, vol. 124, 102534. https://doi.org/10.1016/j.ndteint.2021.102534

Subject Terms: /dk/atira/pure/core/keywords/algorithms_and_complexity, name=Algorithms and Complexity, NDT, NDE, Eddy-Current Testing, ECT, Defect characterisation, Modelling and Simulation

File Description: application/pdf

Availability: https://hdl.handle.net/1983/171dd3ba-31b0-4633-b0e0-30ca4ee11bfb
https://research-information.bris.ac.uk/en/publications/171dd3ba-31b0-4633-b0e0-30ca4ee11bfb
https://doi.org/10.1016/j.ndteint.2021.102534
https://research-information.bris.ac.uk/ws/files/286502123/ECT_Defect_Characterisation_Copy2_.pdf
http://www.scopus.com/inward/record.url?scp=85115954621&partnerID=8YFLogxK

Instability of backoff protocols with arbitrary arrival rates

Authors: Goldberg, LA Lapinskas, J

Source: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554

Subject Terms: Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, name=Algorithms and Complexity, Markov chains, Discrete Mathematics (cs.DM), Probability (math.PR), 0102 computer and information sciences, 02 engineering and technology, stability, Computer science, 01 natural sciences, contention resolution, backoff protocols, Computer Science - Networking and Internet Architecture, random processes, networks, Computer Science - Data Structures and Algorithms, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Mathematics - Probability, Computer Science - Discrete Mathematics

File Description: application/xml

Access URL: http://arxiv.org/abs/2203.17144
https://zbmath.org/8037045
https://doi.org/10.1016/j.jcss.2025.103638
https://ora.ox.ac.uk/objects/uuid:7af8a2f4-0908-4b03-9a36-df9e95219ac9
https://doi.org/10.1016/j.jcss.2025.103638
https://ora.ox.ac.uk/objects/uuid:8238399c-26f8-4689-bea7-295ce7e0a32b
https://doi.org/10.1137/1.9781611977554.ch131

Approximately counting locally-optimal structures

Authors: Goldberg, Leslie Ann Gysel, Rob Lapinskas, John A

Source: Lecture Notes in Computer Science ISBN: 9783662476710
Journal of Computer and System Sciences
ICALP 2015

Subject Terms: FOS: Computer and information sciences, name=Algorithms and Complexity, 03D15, 05C40, 05C69, 68Q17, 68R10, 0211 other engineering and technologies, G.2.2, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 15. Life on land, 16. Peace & justice, 01 natural sciences, Computer Science - Computational Complexity, F.1.3

Access URL: http://arxiv.org/pdf/1411.6829
http://arxiv.org/abs/1411.6829
https://rd.springer.com/chapter/10.1007/978-3-662-47672-7_53
https://link.springer.com/chapter/10.1007%2F978-3-662-47672-7_53
http://dblp.uni-trier.de/db/conf/icalp/icalp2015-1.html#GoldbergGL15
https://dblp.uni-trier.de/db/conf/icalp/icalp2015-1.html#GoldbergGL15
https://www.sciencedirect.com/science/article/pii/S0022000016300137
https://arxiv.org/abs/1411.6829
https://dblp.uni-trier.de/db/journals/corr/corr1411.html#GoldbergGL14
https://core.ac.uk/display/29489039
https://arxiv.org/pdf/1411.6829
https://research-information.bris.ac.uk/en/publications/approximately-counting-locally-optimal-structures
https://ora.ox.ac.uk/objects/uuid:0c04c225-890c-4ddc-a4c0-5dd5b845cb77

Sum-of-Squares Lower Bounds for Non-Gaussian Component Analysis

Authors: Diakonikolas, Ilias Karmalkar, Sushrut Pang, Shuo et al.

Source: Diakonikolas, I, Karmalkar, S, Pang, S & Potechin, A 2024, Sum-of-Squares Lower Bounds for Non-Gaussian Component Analysis. in 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). Annual IEEE Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers (IEEE), pp. 949-958, 65th IEEE Symposium on Foundations of Computer Science, Chicago, Illinois, United States, 27/10/24. https://doi.org/10.1109/focs61266.2024.00063

Subject Terms: Sum-of-Squares, Non-Gaussian Component Analysis (NGCA), Algebra Representation, /dk/atira/pure/core/keywords/algorithms_and_complexity, name=Algorithms and Complexity

Relation: urn:ISBN:9798331516758

Availability: https://hdl.handle.net/1983/7d4a7cae-bbe8-4fda-a5f1-9494232dce8a
https://research-information.bris.ac.uk/en/publications/7d4a7cae-bbe8-4fda-a5f1-9494232dce8a
https://doi.org/10.1109/focs61266.2024.00063
https://focs.computer.org/2024/