zweidimensionales bewegtes Bild
On the Degree of Boolean Functions as Polynomials over ℤ_m: Q/A Session C - Paper C2.F
- Location
-
Hannover TIB
- Extent
-
29MB, 00:17:40:02 (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
-
Wang, Jiaheng
Sun, Xiaoming
Sun, Yuan
Wu, Kewen
Xia, Zhiyu
Zheng, Yufan
- DOI
-
10.5446/49381
- 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
- Wang, Jiaheng
- Sun, Xiaoming
- Sun, Yuan
- Wu, Kewen
- Xia, Zhiyu
- Zheng, Yufan
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Time of origin
- 2020-01-01
Other Objects (12)
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
The complexity of promise SAT on non-Boolean domains: Q/A Session A - Paper A3.C
POLYBORI: A Gröbner basis framework for Boolean polynomials
Low-Degree Approximation of Random Polynomials
A CHARACTERIZATION OF LOW DEGREE POLYNOMIALS
Panel Session Day Two: Q&A
A dichotomy for bounded degree graph homomorphisms with nonnegative weights: Q/A Session B - Paper B1.A
Successor-Invariant First-Order Logic on Classes of Bounded Degree: Q/A Session D - Paper D5.C
Probabilistic estimation of the algebraic degree of Boolean functions
Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials
![Qa- [Qa-]](https://iiif.deutsche-digitale-bibliothek.de/image/2/ad9b8567-c447-46da-a7ba-53b4975e74ba/full/!306,450/0/default.jpg)
Qa- [Qa-]
Intersection distribution of degree four polynomials over finite fields
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
The complexity of promise SAT on non-Boolean domains: Q/A Session A - Paper A3.C
POLYBORI: A Gröbner basis framework for Boolean polynomials
Low-Degree Approximation of Random Polynomials
A CHARACTERIZATION OF LOW DEGREE POLYNOMIALS
Panel Session Day Two: Q&A
A dichotomy for bounded degree graph homomorphisms with nonnegative weights: Q/A Session B - Paper B1.A
Successor-Invariant First-Order Logic on Classes of Bounded Degree: Q/A Session D - Paper D5.C
Probabilistic estimation of the algebraic degree of Boolean functions
Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials
Qa- [Qa-]
Intersection distribution of degree four polynomials over finite fields
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
The complexity of promise SAT on non-Boolean domains: Q/A Session A - Paper A3.C
POLYBORI: A Gröbner basis framework for Boolean polynomials
Low-Degree Approximation of Random Polynomials
A CHARACTERIZATION OF LOW DEGREE POLYNOMIALS
Panel Session Day Two: Q&A
A dichotomy for bounded degree graph homomorphisms with nonnegative weights: Q/A Session B - Paper B1.A
Successor-Invariant First-Order Logic on Classes of Bounded Degree: Q/A Session D - Paper D5.C
Probabilistic estimation of the algebraic degree of Boolean functions
Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials
Qa- [Qa-]