×

Found 40 Documents (Results 1–40)

The 2CNF Boolean formula satisfiability problem and the linear space hypothesis. (English) Zbl 1441.68102

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 62, 14 p. (2017).
MSC:  68Q25 68R07 68T20

Pebbling in 2-paths. (English) Zbl 1347.05120

Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 145-150, electronic only (2015).

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software