zweidimensionales bewegtes Bild
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
- Standort
-
Hannover TIB
- Umfang
-
28MB, 00:19:55:16 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
47th International Colloquium on Automata, Languages and Programming (ICALP) 2020 ; (Jan. 2020)
- Ereignis
-
Veröffentlichung
- (wer)
-
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
- (wann)
-
2020-01-01
- Beteiligte Personen und Organisationen
-
Shirley, Morgan
Pitassi, Toniann
Watson, Thomas
- DOI
-
10.5446/49378
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Shirley, Morgan
- Pitassi, Toniann
- Watson, Thomas
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Entstanden
- 2020-01-01
Ähnliche Objekte (12)
The complexity of promise SAT on non-Boolean domains: Q/A Session A - Paper A3.C
Boolean hierarchies : on collapse properties and query order
The complexity of Boolean functions
Boolean function complexity : advances and frontiers
On the Complexity of Boolean Unification
Complexity of Boolean functions : 10.03. - 14.03.97
Proof Complexity of Quantified Boolean Formulas
Complexity of Boolean functions : 31.10.1999 - 05.11.1999
A Proof Complexity View of Pseudo-Boolean Solving
The complexity of Boolean functions from cryptographic viewpoint
Complexity of Boolean functions : 06111 abstracts collection ; Dagstuhl seminar
![Qa- [Qa-]](https://iiif.deutsche-digitale-bibliothek.de/image/2/ad9b8567-c447-46da-a7ba-53b4975e74ba/full/!306,450/0/default.jpg)
Qa- [Qa-]
The complexity of promise SAT on non-Boolean domains: Q/A Session A - Paper A3.C
Boolean hierarchies : on collapse properties and query order
The complexity of Boolean functions
Boolean function complexity : advances and frontiers
On the Complexity of Boolean Unification
Complexity of Boolean functions : 10.03. - 14.03.97
Proof Complexity of Quantified Boolean Formulas
Complexity of Boolean functions : 31.10.1999 - 05.11.1999
A Proof Complexity View of Pseudo-Boolean Solving
The complexity of Boolean functions from cryptographic viewpoint
Complexity of Boolean functions : 06111 abstracts collection ; Dagstuhl seminar
Qa- [Qa-]
The complexity of promise SAT on non-Boolean domains: Q/A Session A - Paper A3.C
Boolean hierarchies : on collapse properties and query order
The complexity of Boolean functions
Boolean function complexity : advances and frontiers
On the Complexity of Boolean Unification
Complexity of Boolean functions : 10.03. - 14.03.97
Proof Complexity of Quantified Boolean Formulas
Complexity of Boolean functions : 31.10.1999 - 05.11.1999
A Proof Complexity View of Pseudo-Boolean Solving
The complexity of Boolean functions from cryptographic viewpoint
Complexity of Boolean functions : 06111 abstracts collection ; Dagstuhl seminar