Hardware-Oriented Group Solutions for Hard Problems
Mark Burgin
Abstract
Group and individual solutions are considered for hard problems such as satisfiability problem. Time-space trade-off in a structured active memory provides means to achieve lower time complexity for solutions of these problems.
Create a lesson
Related papers
Semidirect sums of tensors and the matrix multiplication exponent
Baitian Li
On the Role of Geometry in Solving Variational Inequalities
Ioannis Anagnostides, Ioannis Panageas, Jingming Yan
The Complexity of ReLU Network Synthesis from a Parameter Multiset
Dimitrios Myrisiotis
The Complexity of KKT Points of Quadratic Programs with Polynomially-Bounded Coefficients
Argyrios Deligkas, Michail Fasoulakis, Stavros D. Ioannidis
A Circuit Complexity Trichotomy For Regular Languages
Stefan Göller, Amaldev Manuel
Determinant boundaries and gaps in determinantal complexity
Karthik Sheshadri