zweidimensionales bewegtes Bild
The complexity of promise SAT on non-Boolean domains: Q/A Session A - Paper A3.C
- Standort
-
Hannover TIB
- Umfang
-
72MB, 00:24:18: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
-
Wrochna, Marcin
Brandts, Alex
Živný, Stanislav
- DOI
-
10.5446/49341
- 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
- Wrochna, Marcin
- Brandts, Alex
- Živný, Stanislav
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Entstanden
- 2020-01-01
Ähnliche Objekte (12)
Combinations of Boolean Gröbner Bases and SAT Solvers
Locally boolean domains and universal models for infinitary sequential languages
SAT Compilation for Constraints over Structured Finite Domains
![Qa- [Qa-]](https://iiif.deutsche-digitale-bibliothek.de/image/2/ad9b8567-c447-46da-a7ba-53b4975e74ba/full/!306,450/0/default.jpg)
Qa- [Qa-]
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
SAT-based verification : from core algorithms to novel application domains
Boolean Algebras
Boolean algebras
Boolean algebras
Boolean Algebras
On the Degree of Boolean Functions as Polynomials over ℤ_m: Q/A Session C - Paper C2.F
Promise
Combinations of Boolean Gröbner Bases and SAT Solvers
Locally boolean domains and universal models for infinitary sequential languages
SAT Compilation for Constraints over Structured Finite Domains
Qa- [Qa-]
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
SAT-based verification : from core algorithms to novel application domains
Boolean Algebras
Boolean algebras
Boolean algebras
Boolean Algebras
On the Degree of Boolean Functions as Polynomials over ℤ_m: Q/A Session C - Paper C2.F
Promise
Combinations of Boolean Gröbner Bases and SAT Solvers
Locally boolean domains and universal models for infinitary sequential languages
SAT Compilation for Constraints over Structured Finite Domains
Qa- [Qa-]
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
SAT-based verification : from core algorithms to novel application domains
Boolean Algebras
Boolean algebras
Boolean algebras
Boolean Algebras
On the Degree of Boolean Functions as Polynomials over ℤ_m: Q/A Session C - Paper C2.F