Hardware-Oriented Group Solutions for Hard Problems
Computational Complexity
2007-05-23 v1
Authors:
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.
Cite
@article{arxiv.cs/0410037,
title = {Hardware-Oriented Group Solutions for Hard Problems},
author = {Mark Burgin},
journal= {arXiv preprint arXiv:cs/0410037},
year = {2007}
}
Related papers
View all related →
Statistical Mechanics · Physics
Renormalization group approach to satisfiability
S. N. Coppersmith
2007-05-23
Distributed, Parallel, and Cluster Computing · Computer Science
High Performance Optimization at the Door of the Exascale
Claude Tadonki
2021-06-23
Computational Complexity · Computer Science
Nested satisfiability
Donald E. Knuth
2008-02-03
Optimization and Control · Mathematics
Hybrid systems with memory: Existence and well-posedness of generalized solutions
Jun Liu, Andrew R. Teel
2017-02-13
Distributed, Parallel, and Cluster Computing · Computer Science
Towards trusted volunteer grid environments
Maher Khemakhem, Abdelfettah Belghith
2019-08-14
Optimization and Control · Mathematics
Learning to solve the single machine scheduling problem with release times and sum of completion times
Axel Parmentier, Vincent T'Kindt
2021-01-05
Optimization and Control · Mathematics
On Finding Stable and Efficient Solutions for the Team Formation Problem
Hoda Atef Yekta, David Bergman, Robert Day
2018-04-03
Emerging Technologies · Computer Science
Efficient Optimization with Higher-Order Ising Machines
Connor Bybee, Denis Kleyko, Dmitri E. Nikonov, Amir Khosrowshahi +2
2022-12-08
Computational Complexity · Computer Science
A Finitely presented group whose word problem has sampleable hard instances
Robert H Gilman
2016-02-09
Data Structures and Algorithms · Computer Science
Efficient Algorithms for Several Constrained Activity Scheduling Problems in the Time and Space Domains
Madalina Ecaterina Andreica, Mugurel Ionut Andreica, Angela Andreica
2009-06-09
Data Structures and Algorithms · Computer Science
Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
Maciej Drwal
2017-08-11
Software Engineering · Computer Science
Object-oriented requirements: reusable, understandable, verifiable
Alexandr Naumchev
2019-03-19
Data Structures and Algorithms · Computer Science
Finding total unimodularity in optimization problems solved by linear programs
Christoph Durr, Mathilde Hurand
2009-09-29
Hardware Architecture · Computer Science
The Future of Memory: Limits and Opportunities
Samuel Dayo, Shuhan Liu, Peijing Li, Philip Levis +4
2025-09-24
Logic in Computer Science · Computer Science
Identifying Tractable Quantified Temporal Constraints within Ord-Horn
Jakub Rydval, Žaneta Semanišinová, Michał Wrona
2024-02-15
Computational Complexity · Computer Science
Towards a Physical Oracle for the Partition Problem using Analogue Computing
Stefan Rass
2017-05-05
Databases · Computer Science
Computational Team Assembly with Fairness Constraints
Rodrigo Borges, Otto Sahlgrens, Sami Koivunen, Kostas Stefanidis +2
2023-06-27
Computational Complexity · Computer Science
On the Complexity of Combinatorial Optimization on Fixed Structures
Nimrod Megiddo
2024-11-27
Computational Complexity · Computer Science
Hard satisfiable formulas for DPLL-type algorithms
Sergey I. Nikolenko
2007-05-23
Artificial Intelligence · Computer Science
Hybrid tractability of soft constraint problems
Martin C. Cooper, Stanislav Zivny
2011-04-25
Computational Complexity · Computer Science
Technical Notes on Complexity of the Satisfiability Problem
Marek A. Suchenek
2015-04-07
Human-Computer Interaction · Computer Science
Unpacking Interpretability: Human-Centered Criteria for Optimal Combinatorial Solutions
Dominik Pegler, Frank Jäkel, David Steyrl, Frank Scharnowski +1
2026-03-11
Computational Complexity · Computer Science
Modular difference logic is hard
Nikolaj Bjørner, Andreas Blass, Yuri Gurevich, Madan Musuvathi
2008-11-07
Programming Languages · Computer Science
Some Challenges of Specifying Concurrent Program Components
Ian J. Hayes
2018-10-24
Cryptography and Security · Computer Science
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints
J. Crampton, R. Crowston, G. Gutin, M. Jones +1
2012-10-16