scholarly journals Efficient deterministic approximate counting for low-degree polynomial threshold functions

Author(s):  
Anindya De ◽  
Rocco A. Servedio
2016 ◽  
Vol 59 ◽  
pp. 04003
Author(s):  
Nuraddeen Muhammad Babangida ◽  
Muhammad Raza Ul Mustafa ◽  
Khamaruzaman Wan Yusuf ◽  
Mohamed Hasnain Isa ◽  
Imran Baig

2005 ◽  
Vol 8 ◽  
pp. 46-79 ◽  
Author(s):  
Derek F. Holt ◽  
Colva M. Roney-Dougal

AbstractThe maximal subgroups of the finite classical groups are divided by a theorem of Aschbacher into nine classes. In this paper, the authors show how to construct those maximal subgroups of the finite classical groups of linear, symplectic or unitary type that lie in the first eight of these classes. The ninth class consists roughly of absolutely irreducible groups that are almost simple modulo scalars, other than classical groups over the same field in their natural representation. All of these constructions can be carried out in low-degree polynomial time.


Geometry ◽  
2013 ◽  
Vol 2013 ◽  
pp. 1-2 ◽  
Author(s):  
E. Ballico

Fix integers m≥5 and d≥3. Let f be a degree d homogeneous polynomial in m+1 variables. Here, we prove that f is the sum of at most d·⌈(m+dm)/(m+1)⌉d-powers of linear forms (of course, this inequality is nontrivial only if m≫d.)


2013 ◽  
Vol 9 (2) ◽  
pp. 347-363
Author(s):  
Francis Deboeverie ◽  
Peter Veelaert ◽  
Wilfried Philips

Sign in / Sign up

Export Citation Format

Share Document