zweidimensionales bewegtes Bild
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
- Location
-
Hannover TIB
- Extent
-
28MB, 00:19:55:16 (unknown)
- Language
-
Englisch
- Notes
-
Audiovisuelles Material
- Bibliographic citation
-
47th International Colloquium on Automata, Languages and Programming (ICALP) 2020 ; (Jan. 2020)
- Event
-
Veröffentlichung
- (who)
-
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
- (when)
-
2020-01-01
- Contributor
-
Shirley, Morgan
Pitassi, Toniann
Watson, Thomas
- DOI
-
10.5446/49378
- Last update
-
04.12.2024, 8:09 AM CET
Data provider
This object is provided by:
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Object type
- zweidimensionales bewegtes Bild
Associated
- Shirley, Morgan
- Pitassi, Toniann
- Watson, Thomas
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Time of origin
- 2020-01-01
Other Objects (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