scientific article
From MaRDI portal
Publication:3299223
DOI10.4230/LIPIcs.FSTTCS.2014.47zbMath1436.68392MaRDI QIDQ3299223
Publication date: 19 July 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
General topics in the theory of algorithms (68W01) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (9)
Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices ⋮ Fast exact algorithms using Hadamard product of polynomials ⋮ Faster All-Pairs Shortest Paths via Circuit Complexity ⋮ A new coding-based algorithm for finding closest pair of vectors ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Probabilistic Degrees of Symmetric Boolean Functions ⋮ Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\) ⋮ From Circuit Complexity to Faster All-Pairs Shortest Paths
This page was built for publication:
