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

← Older edit

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