Computer Science – Computational Complexity
Scientific paper
2004-10-15
Computer Science
Computational Complexity
Scientific paper
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.
Burgin Mark
No associations
LandOfFree
Hardware-Oriented Group Solutions for Hard Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Hardware-Oriented Group Solutions for Hard Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hardware-Oriented Group Solutions for Hard Problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-486527