631 - 640 out of 1,092Page size: 10
  1. 2016

  2. 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 › peer-review

  3. Complexity of distributions and average-case hardness

    Itsykson, D., Knop, A. & Sokolov, D., 1 Dec 2016, 27th International Symposium on Algorithms and Computation, ISAAC 2016. Hong, S-H. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 38.1-38.12 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 64).

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

  4. NORMALIZER OF THE CHEVALLEY GROUP OF TYPE E-7

    Vavilov, N. A. & Luzgarev, A. Y., Dec 2016, In: St. Petersburg Mathematical Journal. 27, 6, p. 899-921 23 p.

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

  5. Largest Chordal and Interval Subgraphs Faster than 2 n

    Bliznets, I., Fomin, F. V., Pilipczuk, M. & Villanger, Y., 1 Oct 2016, In: Algorithmica. 76, 2, p. 569-594 26 p.

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

  6. Sandpiles on the heptagonal tiling

    Kalinin, N. & Shkolnikov, M., 1 Oct 2016, In: Journal of Knot Theory and its Ramifications. 25, 12, 1642005.

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

  7. Simulating fully 3D non-planar evolution of hydraulic fractures

    Cherny, S., Lapin, V., Esipov, D., Kuranakov, D., Avdyushenko, A., Lyutov, A. & Karnakov, P., 1 Oct 2016, In: International Journal of Fracture. 201, 2, p. 181-211 31 p.

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

  8. Systems that generate solutions with a small period

    Pilyugin, S. Y. & Rodioniva, A. A., 30 Sep 2016, In: Vestnik St. Petersburg University: Mathematics. 49, 3, p. 256-259 4 p.

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

  9. Hardness of approximation for H-Free edge modification problems

    Bliznets, I., Cygan, M., Komosa, P. & Pilipczuk, M., 1 Sep 2016, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016. Jansen, K., Mathieu, C., Rolim, J. D. P. & Umans, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 60).

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

  10. A lower bound on the crossing number of uniform hypergraphs

    Anshu, A. & Shannigrahi, S., 20 Aug 2016, In: Discrete Applied Mathematics. 209, p. 11-15 5 p.

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

  11. 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 › peer-review

Previous 1...60 61 62 63 64 65 66 67 ...110 Next

ID: 45528956