Fast parallel constraint satisfaction (Q1313952)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Fast parallel constraint satisfaction	scientific article

Statements

scholarly article

0 references

Fast parallel constraint satisfaction (English)

0 references

zbMATH Open document ID

0 references

10.1016/0004-3702(93)90063-H

0 references

Lefteris M. Kirousis

0 references

Artificial Intelligence

0 references

publication date

19 May 1994

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

constraint satisfaction

0 references

parallel algorithm

0 references

computer vision

0 references

MaRDI profile type

MaRDI publication profile

0 references

A taxonomy of problems with fast parallel algorithms

0 references

From local to global consistency

0 references

A Sufficient Condition for Backtrack-Free Search

0 references

A sufficient condition for backtrack-bounded search

0 references

Constructing a Maximal Independent Set in Parallel

0 references

0 references

0 references

A fast parallel algorithm for the maximal independent set problem

0 references

On the parallel complexity of discrete relaxation in constraint satisfaction networks

0 references

The complexity of recognizing polyhedral scenes

0 references

A Simple Parallel Algorithm for the Maximal Independent Set Problem

0 references

Constraint relaxation may be perfect

0 references

Arc consistency for factorable relations.

0 references

Parallel consistent labeling algorithms

0 references

0 references

A generic arc-consistency algorithm and its specializations

0 references

full work available at URL

https://doi.org/10.1016/0004-3702(93)90063-h

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1313952

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1313952&oldid=37371507"