scientific article; zbMATH DE number 7561312
From MaRDI portal
Publication:5090939
DOI10.4230/LIPIcs.FSTTCS.2018.7MaRDI QIDQ5090939
V. Arvind, Rajit Datta, Abhranil Chatterjee, Partha Mukhopadhyay
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained multilinear detection and generalized graph motifs
- Constrained multilinear detection for faster functional motif discovery
- The ideal membership problem and polynomial identity testing
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- A note on the permanent value problem
- A probabilistic remark on algebraic program testing
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Hilbert's Nullstellensatz is in the polynomial hierarchy
- Polynomial identity testing for depth 3 circuits
- An inequality for the discriminant of a polynomial
- Faster Algebraic Algorithms for Path and Packing Problems
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Combinatorial Nullstellensatz
- Rank and chromatic number of a graph
- Two Algorithmic Results for the Traveling Salesman Problem
- The rank and size of graphs
- LIMITS and Applications of Group Algebras for Parameterized Problems
- Extensor-coding
- From sylvester-gallai configurations to rank bounds
- The complexity of satisfiability problems
- Parameterized Algorithms
- Subresultants and Reduced Polynomial Remainder Sequences
- Power sum decompositions of elementary symmetric polynomials
