Search Results - Theory of computation- Algebraic complexity theory
-
1
Authors: et al.
Contributors: et al.
Source: 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
Subject Terms: 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
File Description: application/pdf
-
2
Authors: et al.
Contributors: et al.
Source: Proc. 36th Computational Complexity Conference, 2021
Subject Terms: 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
File Description: application/pdf
Access URL: 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 -
3
Authors: et al.
Contributors: et al.
Subject Terms: 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
File Description: application/pdf
-
4
Authors: Aguirre Guerrero, Daniela
Contributors: University/Department: Universitat de Girona. Departament d'Arquitectura i Tecnologia de Computadors, University/Department: Universitat de Girona. Institut d'Informàtica i Aplicacions
Thesis Advisors: Vilà Talleda, Pere, Fàbrega i Soler, Lluís
Source: TDX (Tesis Doctorals en Xarxa)
Subject Terms: Fault-tolerant routing, Encaminamiento tolerante a fallos, Encaminament tolerant a fallades, Cayley graphs, Grafos de Cayley, Grafs de Cayley, Automatic group theory, Teoría de grupos automáticos, Teoria de grups automàtics, Path computation algorithms, Algoritmos de búsqueda de caminos, Algoritmes de cerca de camins
File Description: application/pdf
Access URL: http://hdl.handle.net/10803/667410
-
5
Authors: et al.
Contributors: et al.
Source: 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⟩
Subject Terms: Algebraic formulas, Depth reduction, Theory of computation → Algebraic complexity theory, depth-reduction, [INFO]Computer Science [cs]
Subject Geographic: Warwick, United Kingdom
Relation: https://hal.science/hal-04007228v1
-
6
Authors: et al.
Source: Nature Machine Intelligence; Aug2025, Vol. 7 Issue 8, p1195-1205, 11p
-
7
Authors: et al.
Contributors: et al.
Subject Terms: lower bounds, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Lower bounds, ddc:004, Theory of computation → Algebraic complexity theory, Theory of computation → Complexity classes, Elementary symmetric polynomials
File Description: application/pdf
-
8
Authors: et al.
Contributors: et al.
Source: 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
Subject Terms: 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
File Description: application/pdf
-
9
Authors: et al.
Contributors: et al.
Source: 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⟩Subject Terms: Theory of computation → Algebraic complexity theory, Barriers to Lower Bounds, Partial Derivative Method, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
Subject Geographic: United States
Time: Philadelphia (USA), United States
-
10
Authors: et al.
Contributors: et al.
Source: Proc. 36th Computational Complexity Conference, 2021
Subject Terms: 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
File Description: application/pdf
Access URL: 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 -
11
Authors: Ikeda, Kazuki1,2 (AUTHOR) kazuki.ikeda@stonybrook.edu
Source: Acta Mathematica Sinica. Nov2024, Vol. 40 Issue 11, p2693-2718. 26p.
Subject Terms: *QUANTUM graph theory, *QUANTUM computing, *TOPOLOGICAL spaces, *QUANTUM computers, *OPERATOR algebras, *VON Neumann algebras
-
12
Authors:
Contributors:
Subject Terms: 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
File Description: application/pdf
-
13
Authors: et al.
Contributors: et al.
Source: 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
Subject Terms: Matrix multiplication, Slice rank, Tensors, ddc:004, Theory of computation → Algebraic complexity theory, GIT stability, Mathematics of computing, Barriers
File Description: application/pdf
-
14
Authors:
Source: Journal für die reine und angewandte Mathematik (Crelles Journal). 2021:79-131
Subject Terms: FOS: Computer and information sciences, 0102 computer and information sciences, Computational Complexity (cs.CC), Mathematics - Commutative Algebra, Commutative Algebra (math.AC), 01 natural sciences, Computer Science - Computational Complexity, Mathematics - Algebraic Geometry, FOS: Mathematics, 13A50, 14L24, 17B45, 20GXX, 68Q17, 68W30, Representation Theory (math.RT), 0101 mathematics, Algebraic Geometry (math.AG), Mathematics - Representation Theory
Access URL: http://arxiv.org/pdf/1909.00857
http://arxiv.org/abs/1909.00857
https://www.degruyter.com/document/doi/10.1515/crelle-2021-0044/html
https://findanexpert.unimelb.edu.au/scholarlywork/1580865-singular-tuples-of-matrices-is-not-a-null-cone-%28and-the-symmetries-of-algebraic -varieties%29
http://dblp.uni-trier.de/db/journals/corr/corr1909.html#abs-1909-00857
https://dblp.uni-trier.de/db/journals/corr/corr1909.html#abs-1909-00857
https://ui.adsabs.harvard.edu/abs/2019arXiv190900857M/abstract
https://www.arxiv-vanity.com/papers/1909.00857/ -
15
Authors: Dexter C. Kozen
Resource Type: eBook.
Categories: COMPUTERS / Computer Science, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Numerical Analysis
-
16
-
17
Authors: et al.
Contributors: et al.
Source: FSTTCS 2022 ; https://hal.science/hal-04636862 ; FSTTCS 2022, Dec 2022, Madras, India. ⟨10.4230/LIPIcs.FSTTCS.2022.24⟩
Subject Terms: 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]
Subject Geographic: India
Time: Madras, India
-
18
-
19
Authors:
Source: ACM Transactions on Computation Theory, (2025-03-28)
Subject Terms: Arithmetic Circuits, Reconstruction, Learning, Bounded-depth Circuits, Theory of computation, Algebraic complexity theory, Design and analysis of algorithms
Relation: https://authors.library.caltech.edu/communities/caltechauthors/; https://doi.org/10.1145/3726532
Availability: https://doi.org/10.1145/3726532
-
20
Authors: et al.
Contributors: et al.
Source: 49th EATCS International Conference on Automata, Languages, and Programming
Leibniz International Proceedings in InformaticsSubject Terms: FOS: Computer and information sciences, Hardness of Approximation in P, Fine-grained Complexity Theory, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Theory of computation → Approximation algorithms analysis, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Classification Theorems, Data Structures and Algorithms (cs.DS), ddc:004
File Description: application/pdf
Nájsť tento článok vo Web of Science 
Full Text Finder