11 - 20 out of 54Page size: 10
  1. 2018

  2. Lower bounds for unrestricted boolean circuits: Open problems

    Kulikov, A. S., 1 Jan 2018, Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Proceedings. Podolskii, V. V. & Fomin, F. V. (eds.). Springer Nature, p. 15-22 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10846 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  3. 2017

  4. Parameterized Complexity of Superstring Problems

    Bliznets, I., Fomin, F. V., Golovach, P. A., Karpov, N., Kulikov, A. S. & Saurabh, S., 1 Nov 2017, In: Algorithmica. 79, 3, p. 798-813 16 p.

    Research output: Contribution to journal › Article › peer-review

  5. Parameterized Complexity of Secluded Connectivity Problems

    Fomin, F. V., Golovach, P. A., Karpov, N. & Kulikov, A. S., 1 Oct 2017, In: Theory of Computing Systems. 61, 3, p. 795-819 25 p.

    Research output: Contribution to journal › Article › peer-review

  6. Tight lower bounds on graph embedding problems

    Cygan, M., Fomin, F. V., Golovnev, A., Kulikov, A. S., Mihajlin, I., Pachocki, J. & Socała, A., Jun 2017, In: Journal of the ACM. 64, 3, 18.

    Research output: Contribution to journal › Article › peer-review

  7. Computing majority by constant depth majority circuits with low fan-in gates

    Kulikov, A. S. & Podolskii, V. V., 1 Mar 2017, 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017. Vallee, B. & Vollmer, H. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 49. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 66).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  8. 2016

  9. A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function

    Find, M. G., Golovnev, A., Hirsch, E. A. & Kulikov, A. S., 14 Dec 2016, Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016. Institute of Electrical and Electronics Engineers Inc., p. 89-98 10 p. 7782921. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2016-December).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  10. Circuit size lower bounds and #SAT upper bounds through a general framework

    Golovnev, A., Kulikov, A. S., Smal, A. V. & Tamaki, S., 1 Aug 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Muscholl, A., Faliszewski, P. & Niedermeier, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 45. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  11. On the limits of gate elimination

    Golovnev, A., Hirsch, E. A., Knop, A. & Kulikov, A. S., 1 Aug 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Muscholl, A., Faliszewski, P. & Niedermeier, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 46. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  12. Families with infants: Speeding up algorithms for NP-hard problems using FFT

    Golovnev, A., Kulikov, A. S. & Mihajlin, I., Apr 2016, In: ACM Transactions on Algorithms. 12, 3, 35.

    Research output: Contribution to journal › Article › peer-review

  13. Weighted gate elimination: Boolean dispersers for quadratic varieties imply improved circuit lower bounds

    Golovnev, A. & Kulikov, A. S., 14 Jan 2016, ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science. Association for Computing Machinery, p. 405-411 7 p. (ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Previous 1 2 3 4 5 6 Next

ID: 9512817