Result 1 to 20 of 38 total
Computing all MOD-functions simultaneously. (English)
Hirsch, Edward A. (ed.) et al., Computer science ‒ theory and applications. 7th international computer science symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3‒7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30641-9/pbk). Lecture Notes in Computer Science 7353, 81-88 (2012).
1
A $5n - o(n)$ lower bound on the circuit size over $U _{2}$ of a linear Boolean function. (English)
Cooper, S. Barry (ed.) et al., How the world computes. Turing centenary conference and 8th conference on computability in Europe, CiE 2012, Cambridge, UK, June 18‒23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30869-7/pbk). Lecture Notes in Computer Science 7318, 432-439 (2012).
2
On two-colorings of hypergraphs. (English)
Dokl. Math. 83, No. 1, 68-71 (2011); translation from Dokl. Akad. Nauk 436, No. 3, 316-319 (2011).
3
An elementary proof of a $3n - o(n)$ lower bound on the circuit complexity of affine dispersers. (English)
Murlak, Filip (ed.) et al., Mathematical foundations of computer science 2011. 36th international symposium, MFCS 2011, Warsaw, Poland, August 22‒26, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22992-3/pbk). Lecture Notes in Computer Science 6907, 256-265 (2011).
4
Computer science ‒ theory and applications. 6th international computer science symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14‒18, 2011. Proceedings. (English)
Lecture Notes in Computer Science 6651. Berlin: Springer (ISBN 978-3-642-20711-2/pbk). xi, 471~p. EUR~66.34 (2011).
5
An elementary proof of $3n-o(n)$ lower bound on the circuit complexity of affine dispersers. (English)
Electron. Colloq. Comput. Complex. 18, 26 (2011).
6
An elementary proof of a $3n - o(n)$ lower bound on the circuit complexity of affine dispersers (English)
MFCS, 256-265 (2011).
7
New upper bounds on the Boolean circuit complexity of symmetric functions. (English)
Inf. Process. Lett. 110, No. 7, 264-267 (2010).
8
Circuit complexity and multiplicative complexity of Boolean functions. (English)
Ferreira, Fernando (ed.) et al., Programs, proofs, processes. 6th conference on computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30‒July 4, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13961-1/pbk). Lecture Notes in Computer Science 6158, 239-245 (2010).
9
io-port 05754737 Harsha, Prahladh;
Charikar, Moses;
Andrews, Matthew;
Arora, Sanjeev;
Khot, Subhash;
Moshkovitz, Dana;
Zhang, Lisa;
Aazami, Ashkan;
Desai, Dev;
Gorodezky, Igor;
Jagannathan, Geetha;
Kulikov, Alexander S.;
Mir, Darakhshan J.;
Newman, Alantha;
Nikolov, Aleksandar;
Pritchard, David;
Spencer, Gwen
Limits of approximation algorithms: pcps and unique games (DIMACS tutorial lecture notes). (English)
Comput. Res. Repos. 2010, Article No. 1002.3864 (2010).
10
On convex complexity measures. (English)
Theor. Comput. Sci. 411, No. 16-18, 1842-1854 (2010).
11
Circuit complexity and multiplicative complexity of Boolean functions (English)
CiE, 239-245 (2010).
12
New upper bounds for the problem of maximal satisfiability. (English)
Discrete Math. Appl. 19, No. 2, 155-172 (2009); translation from Diskretn. Mat. 21, No. 1, 139-157 (2009).
13
Complexity of semialgebraic proofs with restricted degree of falsity. (English)
J. Satisf. Boolean Model. Comput. 6, No. 1-3, 53-69 (2009).
14
Finding efficient circuits using SAT-solvers. (English)
Kullmann, Oliver (ed.), Theory and applications of satisfiability testing ‒ SAT 2009. 12th international conference, SAT 2009, Swansea, UK, June 30‒July 3, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02776-5/pbk). Lecture Notes in Computer Science 5584, 32-44 (2009).
15
On covering graphs by complete bipartite subgraphs. (English)
Discrete Math. 309, No. 10, 3399-3403 (2009).
16
Complexity of semialgebraic proofs with restricted degree of falsity (English)
JSAT 6, No. 1-3, 53-69 (2009).
17
Finding efficient circuits using SAT-solvers (English)
SAT, 32-44 (2009).
18
The problem of object recognition in the presence of noise in original data (English)
SCAI, 60-67 (2008).
19
New bounds for MAX-SAT by clause learning. (English)
Diekert, Volker (ed.) et al., Computer science ‒ theory and applications. Second international symposium on computer science in Russia, CSR 2007, Ekaterinburg, Russia, September 3‒7, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74509-9/pbk). Lecture Notes in Computer Science 4649, 194-204 (2007).
20
Result 1 to 20 of 38 total
Start
Contact
Print
General Help
