scientific article
From MaRDI portal
Publication:3924096
zbMath0469.94017MaRDI QIDQ3924096
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
On almost bad Boolean bases ⋮ A method for obtaining efficient lower bounds for monotone complexity ⋮ A near-optimal method for reasoning about action ⋮ Parallelizable algebras ⋮ On algorithm complexity ⋮ On the computational complexity of coalitional resource games ⋮ Branching program size is almost linear in formula size ⋮ The game of \(N\) questions of a tree ⋮ On the computational complexity of qualitative coalitional games
This page was built for publication:
