Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments (Q3511328): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Eiji Takimoto / rank | |||
| Property / author | |||
| Property / author: Akira Maruoka / rank | |||
| Property / author | |||
| Property / author: Eiji Takimoto / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Akira Maruoka / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_20 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1556350816 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:50, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments |
scientific article |
Statements
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments (English)
0 references
10 July 2008
0 references
