Skip to main content
SpringerLink
Log in

Special Issue In Memory of Misha Alekhnovich. Foreword

  • Published:
computational complexity Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Alekhnovich M. (2004) Mutilated chessboard problem is exponentially hard for resolution. Theoretical Computer Science 310(1-3): 513–525

    Article  MathSciNet  MATH  Google Scholar 

  • Alekhnovich M. (2005) Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes. IEEE Transactions on Information Theory 51(7): 2257–2265

    Article  MathSciNet  Google Scholar 

  • M. Alekhnovich (2011a). Lower bounds for k-DNF resolution on random 3-CNFs. computational complexity in this volume.

  • M. Alekhnovich (2011b). More on Average Case vs Approximation Complexity. computational complexity in this volume.

  • M. Alekhnovich, S. Arora & I. Tourlakis (2011a). Toward strong nonapproximability results in the Lovász-Schrijver hierarchy. computational complexity in this volume.

  • Alekhnovich M., Ben-Sasson E. (2007) Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs. SIAM Journal on Computing 36(5): 1248–1263

    Article  MathSciNet  Google Scholar 

  • Alekhnovich M., Ben-Sasson E., Razborov A., Wigderson A. (2002) Space complexity in propositional calculus. SIAM Journal on Computing 31(4), 1184–1211

    Article  MathSciNet  MATH  Google Scholar 

  • Alekhnovich M., Ben-Sasson E., Razborov A., Wigderson A. (2004) Pseudorandom generators in propositional proof complexity. SIAM Journal on Computing 34(1), 67–88

    Article  MathSciNet  MATH  Google Scholar 

  • M. Alekhnovich, A. Borodin, J. Buresh-Oppenheim, R. Impgaliazzo, A. Magen, & T. Pitassi (2011b). Toward a model for backtracking and dynamic programming. computational complexity in this volume.

  • Alekhnovich M., Braverman M., Feldman V., Klivans A.R., Pitassi T. (2008) The complexity of properly learning simple concept classes. Journal of Computer and System Sciences 74(1): 16–34

    Article  MathSciNet  MATH  Google Scholar 

  • Alekhnovich M., Buss S., Moran S., Pitassi T. (2001) Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. Journal of Symbolic Logic 66: 171–191

    Article  MathSciNet  MATH  Google Scholar 

  • Alekhnovich M., Hirsch E., Itsykson D. (2005) Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. Journal of Automated Reasoning 35(1-3): 51–72

    Article  MathSciNet  MATH  Google Scholar 

  • Alekhnovich M., Johannsen J., Pitassi T., Urquhart A. (2007) An exponential separation between regular and general resolution. Theory of Computing 3: 81–102

    Article  MathSciNet  Google Scholar 

  • M. Alekhnovich, S. Khot, G. Kindler & N. Vishnoi (2011c). Hardness of approximating the closest vector problem with pre-processing. computational complexity in this volume.

  • Alekhnovich M., Razborov A. (2003) Lower bounds for the polynomial calculus: non-binomial case. Proceedings of the Steklov Institute of Mathematics 242: 18–35

    MathSciNet  Google Scholar 

  • Alekhnovich M., Razborov A. (2008) Resolution is not automatizable unless W[P] is tractable. SIAM Journal on Computing 38(4): 1347–1363

    Article  MathSciNet  MATH  Google Scholar 

  • M. Alekhnovich & A. Razborov (2011). Satisfiability, Branch-Width and Tseitin Tautologies. computational complexity in this volume.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, Toronto, ON, M5S 3G4, Canada

    A. Borodin & T. Pitassi

  2. Department of Computer Science, University of Chicago, Chicago, IL, 60637, USA

    A. Razborov

Authors
  1. A. Borodin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. Pitassi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Razborov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. Razborov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borodin, A., Pitassi, T. & Razborov, A. Special Issue In Memory of Misha Alekhnovich. Foreword. comput. complex. 20, 579–590 (2011). https://doi.org/10.1007/s00037-011-0032-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-011-0032-2

Keywords

Search

Navigation