Processing succinct matrices and vectors (Q2411035): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
aliases / en / 0aliases / en / 0
 
Processing Succinct Matrices and Vectors
description / endescription / en
scientific article
scientific article; zbMATH DE number 6307652
Property / title
 
Processing Succinct Matrices and Vectors (English)
Property / title: Processing Succinct Matrices and Vectors (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1378.68086 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-06686-8_19 / rank
 
Normal rank
Property / published in
 
Property / published in: Computer Science - Theory and Applications / rank
 
Normal rank
Property / publication date
 
24 June 2014
Timestamp+2014-06-24T00:00:00Z
Timezone+00:00
Calendar⧼valueview-expert-timevalue-calendar-gregorian⧽
Precision1 day
Before0
After0
Property / publication date: 24 June 2014 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6307652 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1902950374 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2606727738 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1402.3452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very hard log-space counting class / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of tensor circuit evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of pattern matching for highly compressed two-dimensional texts. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of tree automata and XPath on grammar-compressed trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite presentations of infinite structures: Automata and interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic \(NC^1\) computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of tensor calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions computable in polynomial space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: More concise representation of regular languages by automata and regular expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the multivariate resultant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Matrix Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Space Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leaf languages and string compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics on SLP-compressed strings: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of regular trees and words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4388806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Circuits for Iterated Matrix Product and Powering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5561959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Models of Linear-time Temporal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4899821 / rank
 
Normal rank

Latest revision as of 14:52, 14 July 2024

scientific article; zbMATH DE number 6307652
  • Processing Succinct Matrices and Vectors
Language Label Description Also known as
English
Processing succinct matrices and vectors
scientific article; zbMATH DE number 6307652
  • Processing Succinct Matrices and Vectors

Statements

Processing succinct matrices and vectors (English)
0 references
Processing Succinct Matrices and Vectors (English)
0 references
0 references
0 references
0 references
20 October 2017
0 references
24 June 2014
0 references
0 references
0 references
0 references
0 references
0 references
0 references
multi-terminal decision diagrams
0 references
succinct matrix representations
0 references
matrix computation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references