Ferdinand Börner

According to our database, Ferdinand Börner authored at least 7 papers between 1985 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

The complexity of constraint satisfaction games and QCSP.

Ferdinand Börner, Andrei A. Bulatov, Hubie Chen, Peter Jeavons, Andrei A. Krokhin

Inf. Comput., 2009

2008

Basics of Galois Connections.

Ferdinand Börner

Proceedings of the Complexity of Constraints, 2008

2003

Quantified Constraints: Algorithms and Complexity.

Ferdinand Börner, Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

1998

Generating Sets for Clones and Partial Clones.

Ferdinand Börner, Lucien Haddad

Proceedings of the 28th IEEE International Symposium on Multiple-Valued Logic, 1998

1991

A Note on Minimal Partial Clones.

Ferdinand Börner, Lucien Haddad, Reinhard Pöschel

Proceedings of the 21st International Symposium on Multiple-Valued Logic, 1991

1988

Realization of sets of permutations by permutation networks.

Reinhard Pöschel, Friedmar Wächter, Ferdinand Börner

Proceedings of the Parcella '88, 1988

1985

Sets of Permutations and Their Realization by Permutation Networks.

Ferdinand Börner, Reinhard Pöschel, Michael Gössel

J. Inf. Process. Cybern., 1985