Vilhelm Dahllöf

According to our database, Vilhelm Dahllöf authored at least 8 papers between 2002 and 2006.

Collaborative distances:

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

2006

Exact Algorithms for Exact Satisfiability Problems.

Vilhelm Dahllöf

PhD thesis, 2006

2005

Counting models for 2SAT and 3SAT formulae.

Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström

Theor. Comput. Sci., 2005

Algorithms for Max Hamming Exact Satisfiability.

Vilhelm Dahllöf

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Algorithms for four variants of the exact satisfiability problem.

Vilhelm Dahllöf, Peter Jonsson, Richard Beigel

Theor. Comput. Sci., 2004

Applications of General Exact Satisfiability in Propositional Logic Modelling.

Vilhelm Dahllöf

Proceedings of the Logic for Programming, 2004

2002

An algorithm for counting maximum weighted independent sets and its applications.

Vilhelm Dahllöf, Peter Jonsson

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Finite Domain Constraint Satisfaction Using Quantum Computation.

Ola Angelsmark, Vilhelm Dahllöf, Peter Jonsson

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Counting Satisfying Assignments in 2-SAT and 3-SAT.

Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002