ACC0, sometimes called ACC, is a class of computational models and problems defined in circuit complexity, a field of theoretical computer scienceâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Eric Allender, Shuichi Hirahara
- MFCS
- 2017

The Minimum Circuit Size Problem (MCSP) and a related problem (MKTP) that deals with time-bounded Kolmogorov complexity areâ€¦Â (More)

Is this relevant?

2017

2017

- Shuichi Hirahara, Rahul Santhanam
- Computational Complexity Conference
- 2017

We prove various results on the complexity of MCSP (Minimum Circuit Size Problem) and the related MKTP (Minimum Kolmogorov Timeâ€¦Â (More)

Is this relevant?

2013

2013

- Hamidreza Jahanjou, Eric Miles, Emanuele Viola
- ICALP
- 2013

We reduce non-deterministic time T â‰¥ 2n to a 3SAT instance Ï† of size |Ï†| = T Â· log T such that there is an explicit circuit Câ€¦Â (More)

Is this relevant?

2011

2011

- Arkadev Chattopadhyay, Ricard GavaldÃ , Kristoffer Arnsfelt Hansen, Denis ThÃ©rien
- Theory of Computing Systems
- 2011

Boolean functions that have constant degree polynomial representation over a fixed finite ring form a natural and strict subclassâ€¦Â (More)

Is this relevant?

2010

2010

- Yuval Filmus
- 2010

We will be interested in Boolean functions over the Boolean cube {0, 1} and their polynomial approximations. Razborovâ€™s methodâ€¦Â (More)

Is this relevant?

2009

2009

- Kristoffer Arnsfelt Hansen, Michal KouckÃ½
- computational complexity
- 2009

Barrington, Straubing & ThÃ©rien (1990) conjectured that the Boolean And function can not be computed by polynomial size constantâ€¦Â (More)

Is this relevant?

2003

2003

- Kristoffer Arnsfelt Hansen
- Theory of Computing Systems
- 2003

We obtain a characterization of ACC0 in terms of a natural class of constant width circuits, namely in terms of constant widthâ€¦Â (More)

Is this relevant?

2002

2002

- Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
- computational complexity
- 2002

We consider the computational power of constant width polynomial size cylindrical circuits and nondeterministic branchingâ€¦Â (More)

Is this relevant?

1997

1997

- Manindra Agrawal, Eric Allender, Samir Datta
- IEEE Conference on Computational Complexity
- 1997

Continuing a line of investigation that has studied the function classes #P [Val79b], #SAC1 [Val79a, Vin91, AJMV], #L [AJ93bâ€¦Â (More)

Is this relevant?

1997

1997

Continuing a line of investigation that has studied the function classes #P [Val79b], #SAC1 [Val79a, Vin91, AJMV], #L [AJ93bâ€¦Â (More)

Is this relevant?