Výsledky vyhľadávania - "Theory of computation → Algebraic complexity theory"

On the Power of Homogeneous Algebraic Formulas

Autori: Fournier, Hervé Limaye, Nutan Srinivasan, Srikanth a ďalší

Prispievatelia: Fournier, Hervé Limaye, Nutan Srinivasan, Srikanth a ďalší

Zdroj: Fournier, H, Limaye, N, Srinivasan, S & Tavenas, S 2024, On the Power of Homogeneous Algebraic Formulas . in B Mohar, I Shinkar & R O�Donnell (eds), STOC 2024-Proceedings of the 56th Annual ACM Symposium on Theory of Computing . Association for Computing Machinery, pp. 141-151, 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, Canada, 24/06/2024 . https://doi.org/10.1145/3618260.3649760

Predmety: Formula Homogenization ACM Reference, Algebraic Formulas, Formula Homogenization, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Theory of computation → Algebraic complexity theory, Circuit complexity Algebraic Formulas

Popis súboru: application/pdf

Prístupová URL adresa: https://curis.ku.dk/ws/files/431873603/On_the_Power_of_Homogeneous_Algebraic_Formula.pdf
https://hal.science/hal-04683830v1/document
https://doi.org/10.1145/3618260.3649760
https://hal.science/hal-04683830v1

Revisiting Mulmuley: Simple proof that maxflow is not in the algebraic version of NC

Autori: Léchine, Ulysse Lechine, Ulysse Ulysse Léchine a ďalší

Prispievatelia: Léchine, Ulysse Lechine, Ulysse Ulysse Léchine a ďalší

Predmety: Algebraic complexity, algebraic NC, GCT program, 2012 ACM Subject Classification Theory of computation Algebraic complexity theory phrases Algebraic complexity, [INFO]Computer Science [cs], 2012 ACM Subject Classification Theory of computation Algebraic complexity theory phrases Algebraic complexity P vs NC algebraic NC GCT program Digital Object Identifier 10.4230/LIPIcs, ddc:004, [INFO] Computer Science [cs], P vs NC

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.science/hal-04230207v1
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2023.33

Towards Optimal Depth-Reductions for Algebraic Formulas

Autori: Fournier, Hervé Limaye, Nutan Malod, Guillaume a ďalší

Prispievatelia: Fournier, Hervé Limaye, Nutan Malod, Guillaume a ďalší

Zdroj: LIPIcs, Volume 264 (https://drops.dagstuhl.de/entities/volume/LIPIcs-volume-264) ; 38th Computational Complexity Conference (CCC 2023) ; https://hal.science/hal-03988106 ; 38th Computational Complexity Conference (CCC 2023), Jul 2023, Warwick, United Kingdom. pp. 28:1-28:19, ⟨10.4230/LIPIcs.CCC.2023.28⟩

Predmety: Algebraic formulas, Depth reduction, Theory of computation → Algebraic complexity theory, depth-reduction, [INFO]Computer Science [cs]

Geografické téma: Warwick, United Kingdom

Relation: https://hal.science/hal-04007228v1

Dostupnosť: https://hal.science/hal-03988106
https://hal.science/hal-03988106v2/document
https://hal.science/hal-03988106v2/file/LIPIcs.CCC.2023.28.pdf
https://doi.org/10.4230/LIPIcs.CCC.2023.28

On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials

Autori: Limaye, Nutan Srinivasan, Srikanth Tavenas, Sébastien a ďalší

Prispievatelia: Limaye, Nutan Srinivasan, Srikanth Tavenas, Sébastien a ďalší

Zdroj: 37th Computational Complexity Conference (CCC 2022)
https://hal.science/hal-03761743
37th Computational Complexity Conference (CCC 2022), Jul 2022, Philadelphia (USA), United States. ⟨10.4230/LIPIcs.CCC.2022.32⟩

Predmety: Theory of computation → Algebraic complexity theory, Barriers to Lower Bounds, Partial Derivative Method, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Geografické téma: United States

Time: Philadelphia (USA), United States

Dostupnosť: https://hal.science/hal-03761743
https://hal.science/hal-03761743v1/document
https://hal.science/hal-03761743v1/file/TR22-090.pdf
https://doi.org/10.4230/LIPIcs.CCC.2022.32

Larger Corner-Free Sets from Combinatorial Degenerations

Autori: Christandl, Matthias Fawzi, Omar Ta, Hoang a ďalší

Prispievatelia: Christandl, Matthias Fawzi, Omar Ta, Hoang a ďalší

Zdroj: Christandl, M, Fawzi, O, Ta, H & Zuiddam, J 2022, Larger Corner-Free Sets from Combinatorial Degenerations . in 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) ., 48, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, LIPIcs, vol. 215, pp. 1-20, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), Virtuel, 31/01/2022 . https://doi.org/10.4230/LIPIcs.ITCS.2022.48

Predmety: FOS: Computer and information sciences, Theory of computation → Communication complexity, number on the forehead, Mathematics of computing → Discrete mathematics, Corner-free sets, 0102 computer and information sciences, [INFO] Computer Science [cs], Computational Complexity (cs.CC), combinatorial degeneration, 01 natural sciences, 05D10, 05C65, Computer Science - Computational Complexity, hypergraphs, Shannon capacity, FOS: Mathematics, Mathematics - Combinatorics, communication complexity, Combinatorics (math.CO), ddc:004, 0101 mathematics, Theory of computation → Algebraic complexity theory, eval problem

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2111.08262
https://hal.science/hal-03581653v1
https://doi.org/10.4230/lipics.itcs.2022.48
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.48
https://curis.ku.dk/ws/files/290726294/Larger_Corner_Free_Sets_from_Combinatorial.pdf

Black Box Absolute Reconstruction for Sums of Powers of Linear Forms

Autori: Koiran, Pascal Saha, Subhayan Pascal Koiran and Subhayan Saha

Prispievatelia: Koiran, Pascal Saha, Subhayan Pascal Koiran and Subhayan Saha

Predmety: FOS: Computer and information sciences, reconstruction algorithms, black box, simultaneous diagonalisation, sums of powers of linear forms, 0102 computer and information sciences, [INFO] Computer Science [cs], Computational Complexity (cs.CC), Computing methodologies → Linear algebra algorithms, 01 natural sciences, Computer Science - Computational Complexity, tensor decomposition, Computer Science - Data Structures and Algorithms, Computing methodologies → Algebraic algorithms, Data Structures and Algorithms (cs.DS), ddc:004, algebraic algorithm, 0101 mathematics, Theory of computation → Algebraic complexity theory

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2110.05305
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.24
https://hal.science/hal-04636862v1
https://doi.org/10.4230/lipics.fsttcs.2022.24

Barriers for recent methods in geodesic optimization

Autori: Franks, W. Cole Reichenbach, Philipp W. Cole Franks and Philipp Reichenbach a ďalší

Prispievatelia: Franks, W. Cole Reichenbach, Philipp W. Cole Franks and Philipp Reichenbach a ďalší

Zdroj: Proc. 36th Computational Complexity Conference, 2021

Predmety: FOS: Computer and information sciences, Moment Polytope, Diameter Bounds, Theory of computation → Continuous optimization, Weight Margin, Matrix Scaling, 0102 computer and information sciences, Computational Complexity (cs.CC), Geodesically Convex Optimization, Mathematics of computing → Combinatorics, 01 natural sciences, Primary: 68Q17, Secondary: 05Dxx, 05E10, 14Q20, 20G05, Computer Science - Computational Complexity, Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Combinatorics, Tensor Scaling, Combinatorics (math.CO), ddc:004, 0101 mathematics, Theory of computation → Algebraic complexity theory, Mathematics - Optimization and Control

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2102.06652
https://arxiv.org/abs/2102.06652
https://ui.adsabs.harvard.edu/abs/2021arXiv210206652F/abstract
http://export.arxiv.org/pdf/2102.06652
https://arxiv.org/pdf/2102.06652
https://drops.dagstuhl.de/opus/volltexte/2021/14287/
https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-06652
https://drops.dagstuhl.de/opus/volltexte/2021/14287/pdf/LIPIcs-CCC-2021-13.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.13

Polynomial time algorithms in invariant theory for torus actions

Autori: Bürgisser, P. Doğan, M.L. Makam, V. a ďalší

Prispievatelia: Bürgisser, P. Doğan, M.L. Makam, V. a ďalší

Zdroj: Proc. 36th Computational Complexity Conference, 2021

Predmety: FOS: Computer and information sciences, FOS: Physical sciences, 0102 computer and information sciences, Mathematical Physics (math-ph), 01 natural sciences, orbit closure intersection problem, Mathematics - Algebraic Geometry, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Computing methodologies → Algebraic algorithms, geometric complexity theory, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics, Representation Theory (math.RT), Theory of computation → Algebraic complexity theory, Algebraic Geometry (math.AG), computational invariant theory, Mathematical Physics, Mathematics - Representation Theory

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2102.07727
https://drops.dagstuhl.de/opus/volltexte/2021/14306/pdf/LIPIcs-CCC-2021-32.pdf/
https://doi.org/10.4230/LIPIcs.CCC.2021.32
https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-07727
https://drops.dagstuhl.de/opus/volltexte/2021/14306/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.32

Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras

Autori: Bläser, Markus Lysikov, Vladimir Markus Bläser and Vladimir Lysikov a ďalší

Prispievatelia: Bläser, Markus Lysikov, Vladimir Markus Bläser and Vladimir Lysikov a ďalší

Zdroj: Bläser, M & Lysikov, V 2020, Slice rank of block tensors and irreversibility of structure tensors of algebras . in J Esparza, D Kral� & D Kral� (eds), 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020 ., 17, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, LIPIcs, vol. 170, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, Prague, Czech Republic, 25/08/2020 . https://doi.org/10.4230/LIPIcs.MFCS.2020.17

Predmety: Matrix multiplication, Slice rank, Tensors, ddc:004, Theory of computation → Algebraic complexity theory, GIT stability, Mathematics of computing, Barriers

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.17
https://curis.ku.dk/ws/files/249161729/OA_Slice_Rank_of_Block_Tensors_and_Irreversibility_of.pdf

Nonnegative rank measures and monotone algebraic branching programs

Autori: Fournier, Hervé Malod, Guillaume Szusterman, Maud a ďalší

Prispievatelia: Fournier, Hervé Malod, Guillaume Szusterman, Maud a ďalší

Zdroj: 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⟩

Predmety: 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]

Geografické téma: Mumbai, India

Dostupnosť: 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

Black Box Absolute Reconstruction for Sums of Powers of Linear Forms

Autori: Koiran, Pascal Saha, Subhayan Modèles de calcul, Complexité, Combinatoire (MC2) a ďalší

Prispievatelia: Koiran, Pascal Saha, Subhayan Modèles de calcul, Complexité, Combinatoire (MC2) a ďalší

Zdroj: FSTTCS 2022 ; https://hal.science/hal-04636862 ; FSTTCS 2022, Dec 2022, Madras, India. ⟨10.4230/LIPIcs.FSTTCS.2022.24⟩

Predmety: reconstruction algorithms, tensor decomposition, sums of powers of linear forms, simultaneous diagonalisation, algebraic algorithm, black box, Theory of computation → Algebraic complexity theory, Computing methodologies → Algebraic algorithms, Computing methodologies → Linear algebra algorithms, [INFO]Computer Science [cs]

Geografické téma: India

Time: Madras, India

Dostupnosť: https://hal.science/hal-04636862
https://doi.org/10.4230/LIPIcs.FSTTCS.2022.24