Curriculum Vitae of Mikhail Alekhnovich. Objective Faculty position in Theoretical Computer Science for Fall 2005
|
|
|
- Augustine Taylor
- 5 years ago
- Views:
Transcription
1 Curriculum Vitae of Mikhail Alekhnovich Citizenship: Russian Address: School of Mathematics Institute for Advanced Study Princeton, NJ 08540, US For the up to date version visit Objective Faculty position in Theoretical Computer Science for Fall 2005 Research Interests Computational Complexity Propositional Complexity Algorithms References Avi Wigderson Faculty member of School of Mathematics Institute for Advanced Study, Princeton NJ Alexander A. Razborov Visiting professor of School of Mathematics Institute for Advanced Study, Princeton NJ On leave from Steklov Mathematical Institute, Moscow, Russia Madhu Sudan Professor of Computer Science Department Massachusetts Institute of Technology, Cambridge MA Toniann Pitassi Professor of Computer Science Department University of Toronto, Canada Education Massachusetts Institute of Technology Fall : Graduate student in Department of Mathematics Degree awarded: Ph.D. of Science (Applied Mathematics and Computer Science) Diploma thesis: Propositional Proof Systems: Efficiency and Automatizability Thesis Supervisor: Prof. Madhu Sudan
2 Moscow State University Fall : Student in Department of Mathematics and Mechanics Degree awarded: Diploma with Honors (B.A. equivalent) Diploma thesis: Pseudorandom generators in Propositional Proof Complexity Thesis Supervisor: Prof. Alexander A. Razborov Professional Experience Insitute for Advanced Study Fall : Member Host: Prof. Avi Wigderson Massachusetts Institute of Technology Fall : Research Assistant Supervisor: Prof. Madhu Sudan Insitute for Advanced Study Fall : Member in the special program on Computational Complexity Host: Prof. Avi Wigderson Awards Recipient of the MIT Applied Mathematics Fellowship Award, Conferences, Speaking and Refereeing Invited participant Workshop on: The Propositional Satisfiability Problem Algorithms and Lower Bounds Schloss Dagstuhl, 2003 Workshop on Complexity of Boolean Functions Schloss Dagstuhl, 2002 Workshop on Circuit and Proof Complexity ICMS Edinburgh, 2001 Invited speaker Analysis of the Random Walk Algorithm on Random CNF Formulas NEC Labs Research Seminar, 2003 More on Average case vs. approximation complexity NYU Cryptography Seminar,
3 Conference talks More on Average Case vs Approximation Complexity 44th Annual IEEE Symposium on FOCS 2003, Cambridge, MA, 2003 Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes 43rd Annual IEEE Symposium on FOCS, Vancouver, Canada, 2002 Satisfiability, Branch-Width and Tseitin Tautologies 43rd Annual IEEE Symposium on FOCS, Vancouver, Canada, 2002 An exponential separation between regular and general resolution 34th Annual ACM STOC, Montréal, Québec, Canada, 2002 Resolution is Not Automatizable Unless W[P] is Tractable 42nd Annual IEEE Symposium on FOCS, Las Vegas, Nevada, 2001 Pseudorandom Generators in Propositional Proof Complexity 41st Annual IEEE Symposium on FOCS, Redondo Beach, California, 2000 Minimum Propositional Proof Length is NP-Hard to Linearly Approximate 23rd International Symposium MFCS, Brno, Czech Republic, 1998 Referee for ACM Transactions on Computational Logic SIAM Journal on Computing IEEE Transactions on Information Theory Information Processing Letters 45th Annual IEEE Symposium on FOCS, th Annual ACM STOC, th Annual IEEE Conf. on Computational Complexity,
4 Publications Recently Submitted Hardness of approximating the closest vector problem with pre-processing, Subhash Khot, Guy Kindler, Nisheeth Vishnoi Inapproximability of Fixed Parameter Problems, Subhash Khot, Toniann Pitassi In Journals Learnability and Automatizability, Mark Braverman, Vitaly Feldman, Adam Klivans, Toniann Pitassi To appear in JCSS special issue on learning theory papers of 2004 Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas, Edward A. Hirsch, Dmitry Itsykson To appear in 2005 SAT special issue of the Journal of Automated Reasoning Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes To appear in IEEE Transactions on Information Theory Mutilated chessboard problem is exponentially hard for resolution Theoretical Computer Science, 2004 Lower Bounds for Polynomial Calculus: Non-Binomial Case, Alexander A. Razborov In Proceedings of the Steklov Institute of Mathematics, 2003 Pseudorandom Generators in Propositional Proof Complexity, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson SIAM Journal on Computing, 2004 Space Complexity in Propositional Calculus, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson SIAM Journal on Computing, 2002 Minimum Propositional Proof Length is NP-Hard to Linearly Approximate, Samuel R. Buss, Shlomo Moran, Toniann Pitassi Journal of Symbolic Logic,
5 In Refereed Conferences Toward a Model for Backtracking and Dynamic Programming, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi To appear in Proc. 20th Annual Conference on Computational Complexity, 2005 Towards strong nonapproximability results in the Lovász-Schrijver hierarchy, Sanjeev Arora, Iannis Tourlakis To appear in Proc. 37th Annual ACM STOC, 2005 Lower bounds for k-dnf Resolution on random 3-CNFs To appear in Proc. 37th Annual ACM STOC, 2005 Learnability and Automatizability, Mark Braverman, Vitaly Feldman, Adam Klivans, Toniann Pitassi In Proc. 44th IEEE Symposium on FOCS, 2004 Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas, Edward A. Hirsch, Dmitry Itsykson In Proc. 31st ICALP, 2004 More on Average Case vs Approximation Complexity In Proc. 44th IEEE Symposium on FOCS, 2003 Linear Upper Bounds for Random Walk on Small Density Random 3-CNF, Eli Ben-Sasson In Proc. 44th IEEE Symposium on FOCS, 2003 Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes In Proc. 43rd IEEE Symposium on FOCS, 2002 Satisfiability, Branch-Width and Tseitin Tautologies, Alexander A. Razborov In Proc. 43rd IEEE Symposium on FOCS, 2002 An exponential separation between regular and general resolution, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart In Proc. 34th Annual ACM STOC, 2002 Lower Bounds for Polynomial Calculus: Non-Binomial Case, Alexander A. Razborov In Proc. 42nd IEEE Symposium on FOCS, 2001 Resolution is Not Automatizable Unless W[P] is Tractable, Alexander A. Razborov In Proc. 42nd IEEE Symposium on FOCS,
6 Pseudorandom Generators in Propositional Proof Complexity, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson In Proc. 41st IEEE Symposium on FOCS, 2000 Space Complexity in Propositional Calculus, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson In Proc. 32nd Annual ACM STOC, 2000 Minimum Propositional Proof Length is NP-Hard to Linearly Approximate, Samuel R. Buss, Shlomo Moran, Toniann Pitassi In Proc. 23rd International Symposium MFCS,
The NP-hardness of finding a directed acyclic graph for regular resolution
The NP-hardness of finding a directed acyclic graph for regular resolution Samuel R. Buss Department of Mathematics University of California, San Diego La Jolla, CA 92093-0112, USA sbuss@math.ucsd.edu
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate (Extended Abstract)
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate (Extended Abstract) Michael Alekhnovich 1, Sam Buss 2, Shlomo Moran 3, and Toniann Pitassi 4 1 Moscow State University, Russia, michael@mail.dnttm.ru
On the Automatizability of Resolution and Related Propositional Proof Systems
On the Automatizability of Resolution and Related Propositional Proof Systems Albert Atserias and María Luisa Bonet Departament de Llenguatges i Sistemes Informàtics Universitat Politècnica de Catalunya
CSC 2429 Approaches to the P vs. NP Question and Related Complexity Questions Lecture 2: Switching Lemma, AC 0 Circuit Lower Bounds
CSC 2429 Approaches to the P vs. NP Question and Related Complexity Questions Lecture 2: Switching Lemma, AC 0 Circuit Lower Bounds Lecturer: Toniann Pitassi Scribe: Robert Robere Winter 2014 1 Switching
Introduction. 1 Partially supported by a grant from The John Templeton Foundation
Nisan-Wigderson generators in proof systems with forms of interpolation Ján Pich 1 Faculty of Mathematics and Physics Charles University in Prague March, 2010 We prove that the Nisan-Wigderson generators
Optimal Sherali-Adams Gaps from Pairwise Independence
Optimal Sherali-Adams Gaps from Pairwise Independence Konstantinos Georgiou Avner Magen Madhur Tulsiani {cgeorg,avner}@cs.toronto.edu, madhurt@cs.berkeley.edu Abstract This work considers the problem of
Regular Resolution Lower Bounds for the Weak Pigeonhole Principle
Regular Resolution Lower Bounds for the Weak Pigeonhole Principle Toniann Pitassi Department of Computer Science University of Toronto toni@cs.toronto.edu Ran Raz Department of Computer Science Weizmann
Towards NP P via Proof Complexity and Search
Towards NP P via Proof Complexity and Search Samuel R. Buss Department of Mathematics University of California, San Diego La Jolla, CA 92093-0112, USA sbuss@math.ucsd.edu October 4, 2009 Abstract This
Representations of Monotone Boolean Functions by Linear Programs
Representations of Monotone Boolean Functions by Linear Programs Mateus de Oliveira Oliveira 1 and Pavel Pudlák 2 1 University of Bergen, Bergen, Norway mateus.oliveira@uib.no 2 Czech Academy of Sciences,
CURRICULUM VITAE Roman V. Krems
CURRICULUM VITAE Roman V. Krems POSTAL ADDRESS: Department of Chemistry, University of British Columbia 2036 Main Mall, Vancouver, B.C. Canada V6T 1Z1 Telephone: +1 (604) 827 3151 Telefax: +1 (604) 822
Lower Bounds for Bounded Depth Frege Proofs via Buss-Pudlák Games
Lower Bounds for Bounded Depth Frege Proofs via Buss-Pudlák Games Eli Ben-Sasson Prahladh Harsha Abstract We present a simple proof of the bounded-depth Frege lower bounds of Pitassi et. al. and Krajíček
Sofya Raskhodnikova
Sofya Raskhodnikova sofya@wisdom.weizmann.ac.il Work: Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot, Israel 76100 +972 8 934 3573 http://theory.lcs.mit.edu/
Organization. Informal introduction and Overview Informal introductions to P,NP,co-NP and themes from and relationships with Proof complexity
15-16/08/2009 Nicola Galesi 1 Organization Informal introduction and Overview Informal introductions to P,NP,co-NP and themes from and relationships with Proof complexity First Steps in Proof Complexity
The Tensor Product of Two Codes is Not Necessarily Robustly Testable
The Tensor Product of Two Codes is Not Necessarily Robustly Testable Paul Valiant Massachusetts Institute of Technology pvaliant@mit.edu Abstract. There has been significant interest lately in the task
Complexity of propositional proofs: Some theory and examples
Complexity of propositional proofs: Some theory and examples Univ. of California, San Diego Barcelona April 27, 2015 Frege proofs Introduction Frege proofs Pigeonhole principle Frege proofs are the usual
Shortest Vector Problem (1982; Lenstra, Lenstra, Lovasz)
Shortest Vector Problem (1982; Lenstra, Lenstra, Lovasz) Daniele Micciancio, University of California at San Diego, www.cs.ucsd.edu/ daniele entry editor: Sanjeev Khanna INDEX TERMS: Point lattices. Algorithmic
Lecture 20: Course summary and open problems. 1 Tools, theorems and related subjects
CSE 533: The PCP Theorem and Hardness of Approximation (Autumn 2005) Lecture 20: Course summary and open problems Dec. 7, 2005 Lecturer: Ryan O Donnell Scribe: Ioannis Giotis Topics we discuss in this
CURRICULUM VITAE. Theodoulos Garefalakis
CURRICULUM VITAE Theodoulos Garefalakis Personal Date of birth : 10 September 1972 Place of birth : Heraklion, Crete, Greece Nationality : Greek Address : Department of Mathematics and Applied Mathematics
Linear Level Lasserre Lower Bounds for Certain k-csps
Linear Level Lasserre Lower Bounds for Certain k-csps Grant Schoenebeck Abstract We show that for k 3 even the Ωn) level of the Lasserre hierarchy cannot disprove a random k-csp instance over any predicate
Exponential Separations in a Hierarchy of Clause Learning Proof Systems
Electronic Colloquium on Computational Complexity, Report No. 72 (2013) Exponential Separations in a Hierarchy of Clause Learning Proof Systems Jan Johannsen Institut fur Informatik Ludwig-Maximilians-Universitat
Resolution and the Weak Pigeonhole Principle
Resolution and the Weak Pigeonhole Principle Sam Buss 1 and Toniann Pitassi 2 1 Departments of Mathematics and Computer Science University of California, San Diego, La Jolla, CA 92093-0112. 2 Department
Poly-logarithmic independence fools AC 0 circuits
Poly-logarithmic independence fools AC 0 circuits Mark Braverman Microsoft Research New England January 30, 2009 Abstract We prove that poly-sized AC 0 circuits cannot distinguish a poly-logarithmically
On extracting computations from propositional proofs (a survey)
On extracting computations from propositional proofs (a survey) Pavel Pudlák September 16, 2010 Abstract This paper describes a project that aims at showing that propositional proofs of certain tautologies
Last time, we described a pseudorandom generator that stretched its truly random input by one. If f is ( 1 2
CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 20: N W Pseudorandom Generator November 25, 2004 Scribe: Ladan A. Mahabadi 1 Introduction In this last lecture of the course, we ll discuss the
A Duality between Clause Width and Clause Density for SAT
A Duality between Clause Width and Clause Density for SAT Chris Calabro, Russell Impagliazzo, Ramamohan Paturi University of California, San Diego 9500 Gilman Drive, La Jolla, CA 92093 ccalabro,russell,paturi
Homogenization and the Polynomial Calculus
Homogenization and the Polynomial Calculus Josh Buresh-Oppenheim Computer Science Department University of Arizona Tucson, AZ 85719 bureshop@cs.arizona.edu Russell Impagliazzo Computer Science and Engineering
From Small Space to Small Width in Resolution
From Small Space to Small Width in Resolution Yuval Filmus 1, Massimo Lauria 2, Mladen Mikša 2, Jakob Nordström 2, and Marc Vinyals 2 1 Simons Institute for the Theory of Computing, University of California,
Parameterized Complexity of DPLL Search Procedures
Parameterized Complexity of DPLL Search Procedures Olaf Beyersdorff 1, Nicola Galesi 2, and Massimo Lauria 2 1 Institut für Theoretische Informatik, Leibniz Universität Hannover, Germany 2 Dipartimento
Upper and Lower Bounds for Tree-like. Cutting Planes Proofs. Abstract. In this paper we study the complexity of Cutting Planes (CP) refutations, and
Upper and Lower Bounds for Tree-like Cutting Planes Proofs Russell Impagliazzo Toniann Pitassi y Alasdair Urquhart z UCSD UCSD and U. of Pittsburgh University of Toronto Abstract In this paper we study
A New Approach to Proving Upper Bounds for MAX-2-SAT
A New Approach to Proving Upper Bounds for MAX-2-SAT Arist Kojevnikov Alexander S. Kulikov Abstract In this paper we present a new approach to proving upper bounds for the maximum 2-satisfiability problem
Communication Lower Bounds via Critical Block Sensitivity
Communication Lower Bounds via Critical Block Sensitivity Mika Göös & Toniann Pitassi University of Toronto Göös & Pitassi (Univ. of Toronto) Communication Lower Bounds 13th January 2014 1 / 18 Communication
Resolution and Pebbling Games
Resolution and Pebbling Games Nicola Galesi and Neil Thapen Abstract. We define a collection of Prover-Delayer games to characterise some subsystems of propositional resolution. We give some natural criteria
Lower bounds for width-restricted clause learning on small width formulas
Electronic Colloquium on Computational Complexity, Report No. 85 (2010) Lower bounds for width-restricted clause learning on small width formulas Eli Ben-Sasson 1 and Jan Johannsen 2 1 Computer Science
From average case complexity to improper learning complexity
From average case complexity to improper learning complexity [Extended Abstract] Amit Daniely Nati Linial Dept. of Mathematics, The School of Computer Science Hebrew University, Jerusalem, and Engineering,
RESOLUTION IS NOT AUTOMATIZABLE UNLESS W[P] IS TRACTABLE
![RESOLUTION IS NOT AUTOMATIZABLE UNLESS W[P] IS TRACTABLE](/thumbs/88/115371861.jpg "RESOLUTION IS NOT AUTOMATIZABLE UNLESS W[P] IS TRACTABLE")
RESOLUTION IS NOT AUTOMATIZABLE UNLESS W[P] IS TRACTABLE MICHAEL ALEKHNOVICH AND ALEXANDER A. RAZBOROV Abstract. We show that neither Resolution nor tree-like Resolution is automatizable unless the class
CSC 2429 Approaches to the P versus NP Question. Lecture #7 (part 2): 5 March 2014
CSC 2429 Approaches to the P versus NP Question Lecture #7 (part 2): 5 March 2014 Lecturer: Joshua A. Grochow Scribe Notes by: Joshua A. Grochow Copyright Joshua A. Grochow, March 2014, all rights reserved.
Supercritical Space-Width Trade-offs for Resolution
Supercritical Space-Width Trade-offs for Resolution Christoph Berkholz 1 and Jakob Nordström 2 1 Humboldt-Universität zu Berlin Unter den Linden 6, 10099 Berlin, Germany 2 KTH Royal Institute of Technology
Resolution Lower Bounds for the Weak Pigeonhole Principle
Electronic Colloquium on Computational Complexity, Report No. 21 (2001) Resolution Lower Bounds for the Weak Pigeonhole Principle Ran Raz Weizmann Institute, and The Institute for Advanced Study ranraz@wisdom.weizmann.ac.il
Towards NEXP versus BPP?
Towards NEXP versus BPP? Ryan Williams Stanford University Abstract. We outline two plausible approaches to improving the miserable state of affairs regarding lower bounds against probabilistic polynomial
The Ackermann Award 2009
The Ackermann Award 2009 J.A. Makowsky and A. Razborov Members of EACSL Jury for the Ackermann Award The fifth Ackermann Award is presented at this CSL 09, held in Coimbra, Portugal. This is the third
Curriculum Vitae. Current and Past Positions. Department of Mathematics Koç University Assistant Professor Department of Mathematics
Curriculum Vitae Name : Emre Mengi Date of Birth : February 27, 1978 Place of Birth : Ankara, Turkey Nationality : Turkish Address : Koç University Rumelifeneri Yolu 34450 Sarıyer, Istanbul / Turkey Phone
The Complexity of Resolution Refinements
The Complexity of Resolution Refinements Joshua Buresh-Oppenheim Computer Science Department University of Toronto Toronto, ON bureshop@cs.toronto.edu Toniann Pitassi Computer Science Department University
Khodabakhsh Hessami Pilehrood
CURRICULUM VITAE Khodabakhsh Hessami Pilehrood Date and place of birth Citizenship Address August 23, 1965; Ardebil, Iran Iran Mathematics Department Faculty of Science Shahrekord University, P.O.Box 115
Curriculum Vitae. Department of Mathematics, UC Berkeley 970 Evans Hall, Berkeley, CA
Personal Information Official Name: Transliteration used in papers: Mailing Address: E-mail: Semen Artamonov Semeon Arthamonov Department of Mathematics, UC Berkeley 970 Evans Hall, Berkeley, CA 94720
CSC Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method Notes taken by Stefan Mathe April 28, 2007 Summary: Throughout the course, we have seen the importance
NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors
Electronic Colloquium on Computational Complexity, Report No. 73 (2018) NP-hardness of coloring 2-colorable with poly-logarithmically many colors Amey Bhangale April 21, 2018 Abstract We give very short
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography Edward A. Hirsch Dmitry Itsykson Ivan Monakhov Alexander Smal Steklov Institute of Mathematics
Fengxin Chen. updated in Dec. 2008
Fengxin Chen updated in Dec. 2008 Address: Department of Mathematics University of Texas at San Antonio One UTSA Circle San Antonio, TX 78249 Tel: (210)-458-5696 (work) Tel: (210)-695-9299 (home) Email:
Homogenization and the Polynomial Calculus
Homogenization and the Polynomial Calculus Josh Buresh-Oppenheim,1, Toniann Pitassi,1, Matt Clegg 2, and Russell Impagliazzo,2 1 Computer Science Department, University of Arizona Tucson, AZ 85721, USA
Optimal Hardness Results for Maximizing Agreements with Monomials
Optimal Hardness Results for Maximizing Agreements with Monomials Vitaly Feldman Harvard University Cambridge, MA 02138 vitaly@eecs.harvard.edu Abstract We consider the problem of finding a monomial (or
Harvard University NSF Postdoctoral Fellow and Instructor, 2016 Mentor: Michael Hopkins
Ben Knudsen Contact information Department of Mathematics 1 Oxford St Cambridge, MA 02138 knudsen@math.harvard.edu scholar.harvard.edu/knudsen Employment Education NSF Postdoctoral Fellow and Instructor,
CURRICULUM VITAE. Sevag Gharibian RESEARCH INTERESTS EMPLOYMENT
CURRICULUM VITAE Sevag Gharibian Junior Professor (W1) Faculty of Computer Science, Electrical Engineering, and Mathematics University of Paderborn, 33098 Paderborn, Germany Email: sevag.gharibian@gmail.com
Refutation of Products of Linear Polynomials
Refutation of Products of Linear Polynomials Jan Horáček and Martin Kreuzer Faculty of Informatics and Mathematics University of Passau, D-94030 Passau, Germany Jan.Horacek@uni-passau.de, Martin.Kreuzer@uni-passau.de
Curriculum Vitae. Address: Department of Mathematics, National Cheng Kung University, 701 Tainan, Taiwan.
Curriculum Vitae 1. Personal Details: Name: Kung-Chien Wu Gender: Male E-mail address kcwu@mail.ncku.edu.tw kungchienwu@gmail.com Address: Department of Mathematics, National Cheng Kung University, 701
Resolution lower bounds for the weak functional pigeonhole principle
Theoretical Computer Science 303 (2003) 233 243 www.elsevier.com/locate/tcs Resolution lower bounds for the weak functional pigeonhole principle a; b; Alexander A. Razborov a Steklov Mathematical Institute,
Short Proofs Are Narrow Resolution Made Simple
ELI BEN-SASSON AND AVI WIGDERSON Hebrew University, Jerusalem, Israel Abstract. The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper,
RANDOM CNF S ARE HARD FOR THE POLYNOMIAL CALCULUS
comput. complex. 19 (2010), 501 519 1016-3328/10/040501-19, published online 11 August 2010 DOI 10.1007/s00037-010-0293-1 c Springer Basel AG 2010 computational complexity RANDOM CNF S ARE HARD FOR THE
STUDIES IN ALGEBRAIC AND PROPOSITIONAL PROOF COMPLEXITY. Iddo Tzameret
TEL AVIV UNIVERSITY THE RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES SCHOOL OF COMPUTER SCIENCE STUDIES IN ALGEBRAIC AND PROPOSITIONAL PROOF COMPLEXITY Thesis Submitted for the Degree of Doctor
Proof Complexity Meets Algebra,
Proof Complexity Meets Algebra joint work with Albert Atserias Université Paris Diderot - Paris 7 Logical Structures in Computation Reunion Workshop Simons Institute, 13th December 2017 (CSP problem) P
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Journal of Algorithms 54 (2005) 40 44 www.elsevier.com/locate/jalgor An algorithm for the satisfiability problem of formulas in conjunctive normal form Rainer Schuler Abt. Theoretische Informatik, Universität
Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack
Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack Anna R. Karlin Claire Mathieu C. Thach Nguyen Abstract Recent years have seen an explosion of interest in lift and project
Learning Restricted Models of Arithmetic Circuits
Learning Restricted Models of Arithmetic Circuits Adam R. Klivans Department of Computer Science University of Texas at Austin Austin, TX 78712-1188 klivans@cs.utexas.edu Amir Shpilka Faculty of Computer
On the hardness of approximating label-cover
Information Processing Letters 89 (2004) 247 254 www.elsevier.com/locate/ipl On the hardness of approximating label-cover Irit Dinur, Shmuel Safra School of Mathematics and Computer Science, Tel-Aviv University,
Curriculum Vitae. Mihály Petreczky
Curriculum Vitae Mihály Petreczky Personal data Name: Visa Status: Address: Mihály Petreczky J-1 (research scholar) Center For Imaging Science Johns Hopkins University 324B Clark Hall, 3400 North Charles
Sherali-Adams relaxations of the matching polytope
Sherali-Adams relaxations of the matching polytope Claire Mathieu Alistair Sinclair November 17, 2008 Abstract We study the Sherali-Adams lift-and-project hierarchy of linear programming relaxations of
Efficient Learning Algorithms Yield Circuit Lower Bounds
Efficient Learning Algorithms Yield Circuit Lower Bounds Lance Fortnow University of Chicago Computer Science Department fortnow@cs.uchicago.edu Adam R. Klivans The University of Texas at Austin Computer
CURRICULUM VITAE. Christian Wolf Department of Mathematics Wichita State University. Wichita, KS Citizenship: Germany, Permanent Resident: USA
CURRICULUM VITAE Christian Wolf Department of Mathematics Wichita State University Wichita, KS 67260 Citizenship: Germany, Permanent Resident: USA e mail: cwolf@math.wichita.edu Phone #: Office: 316 978
Max Cut (1994; 1995; Goemans, Williamson)
Max Cut (1994; 1995; Goemans, Williamson) Alantha Newman Max-Planck-Institut für Informatik http://www.mpi-inf.mpg.de/alantha 1 Index Terms Graph partitioning, Approximation algorithms. 2 Synonyms Maximum
Gerasim K. Iliev. D.O.B: May 28, 1980 Citizenship: Canadian Tel:
Gerasim K. Iliev D.O.B: May 28, 1980 Citizenship: Canadian Tel: +1 706 461 4228 giliev@gmail.com https://faculty.franklin.uga.edu/giliev/ Education: University of Toronto 1999 2008 Doctor of Philosophy
Postdoctoral Researcher, Otto-von-Guericke University, Germany, September September 2013,
Contact Information Address: İstanbul Kemerburgaz University Faculty of Arts and Sciences Mahmutbey Dilmenler Caddesi, No:26 34217 Bağcılar-İstanbul Turkey E-mail: ayca.cesmelioglu@kemerburgaz.edu.tr Present
Approximating maximum satisfiable subsystems of linear equations of bounded width
Approximating maximum satisfiable subsystems of linear equations of bounded width Zeev Nutov The Open University of Israel Daniel Reichman The Open University of Israel Abstract We consider the problem
This is a repository copy of Proof Complexity of Non-classical Logics..
This is a repository copy of Proof Complexity of Non-classical Logics.. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/74776/ Proceedings Paper: Beyersdorff, O (2010) Proof
Nisheeth K. Vishnoi. Research Interests. Education. Recognition. Professional Activities. École Polytechnique Fédérale de Lausanne (EPFL)
Nisheeth K. Vishnoi École Polytechnique Fédérale de Lausanne (EPFL) nisheeth.vishnoi@epfl.ch Research Interests Optimization,, Spectral Methods,, Markov Chains, Evolution, Theoretical Machine Learning
Curriculum Vitae Ziv Shami
Curriculum Vitae Ziv Shami Address: Dept. of Mathematics and Computer Science Ariel University Samaria, Ariel 44873 Israel. Phone: 0528-413477 Email: zivshami@gmail.com Army Service: November 1984 to June
IHOR STASYUK CURRICULUM VITAE.
CURRICULUM VITAE IHOR STASYUK Address Department of Computer Science and Mathematics Nipissing 100 College Drive, Box 5002 North Bay, Ontario, P1B 8L7, Canada E-mail ihors@nipissingu.ca Phone (705) 474-3450
A Note on the Karp-Lipton Collapse for the Exponential Hierarchy
A Note on the Karp-Lipton Collapse for the Exponential Hierarchy Chris Bourke Department of Computer Science & Engineering University of Nebraska Lincoln, NE 68503, USA Email: cbourke@cse.unl.edu January
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space Alexander Hertel & Alasdair Urquhart June 18, 2007 Abstract The Prover/Delayer game is a combinatorial game that can be used
Curriculum Vitae. Youngmi Hur
Curriculum Vitae Youngmi Hur Current Position: Assistant Professor in Department of Applied Mathematics and Statistics, Johns Hopkins University Address: 3400 North Charles St. Baltimore, MD 21218 Phone:
Stanford University, Stanford, California. Szegö Assistant Professor of Mathematics,
Benjamin B. Brubaker Associate Professor, School of Mathematics University of Minnesota Room 233, Vincent Hall 206 Church Street SE Minneapolis, MN 55455 (612) 625-6380 (office) Citizenship: USA (612)
On Quantum Versions of Record-Breaking Algorithms for SAT
On Quantum Versions of Record-Breaking Algorithms for SAT Evgeny Dantsin 1, Vladik Kreinovich 2, and Alexander Wolpert 1 1 Department of Computer Science, Roosevelt University Chicago, IL 60605, USA, {edantsin,awolpert}@roosevelt.edu
Geometric Complexity and Applications CIS 6930 August 26 - September 4, Lecture 1 through 4
Geometric Complexity and Applications CIS 6930 August 26 - September 4, 2008 Lecture 1 through 4 Lecturer: Dr. Meera Sitharam Scribe: Venkatakrishnan Ramaswamy 1 Introduction Geometric Complexity is a
A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness
A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story
Improving Integrality Gaps via Chvátal-Gomory Rounding
Improving Integrality Gaps via Chvátal-Gomory Rounding Mohit Singh Kunal Talwar June 23, 2010 Abstract In this work, we study the strength of the Chvátal-Gomory cut generating procedure for several hard
Curriculum Vitae. Stefan Schnabel June 9, Abitur (general qualification for university entrance)
Curriculum Vitae Stefan Schnabel June 9, 2016 Dr. Stefan Schnabel Institut für Theoretische Physik Brüderstrasse 16 Universität, 04103 Email : schnabel@itp.uni-leipzig.de Phone: 0049 341 9732429 Citizenship:
Linear Level Lasserre Lower Bounds for Certain k-csps
Linear Level Lasserre Lower Bounds or Certain k-csps Grant Schoenebeck Abstract We show that or k 3 even the Ωn) level o the Lasserre hierarchy cannot disprove a random k-csp instance over any predicate
Proof Complexity of Pigeonhole Principles
Proof Complexity of Pigeonhole Principles Alexander A. Razborov Steklov Mathematical Institute, Moscow, Russia Institute for Advanced Study, Princeton, USA Abstract. The pigeonhole principle asserts that
Tuples of Disjoint NP-Sets
Tuples of Disjoint NP-Sets (Extended Abstract) Olaf Beyersdorff Institut für Informatik, Humboldt-Universität zu Berlin, 10099 Berlin, Germany beyersdo@informatik.hu-berlin.de Abstract. Disjoint NP-pairs
The School of Science and Engineering
The School of Science and Engineering Chemistry Office: 2015 Percival Stern Hall Phone: (504) 865-5573 Fax: (504) 865-5596 Website: http://chem.tulane.edu Professors Larry D. Byers, Ph.D., Princeton Mark
Stanislav M. Mintchev
Department of Mathematics Contact Information and Webpages Albert Nerken School of Engineering office: 212-353-4319 The Cooper Union mintchev@cooper.edu 41 Cooper Square http://faculty.cooper.edu/mintchev
Sherali-Adams Relaxations of the Matching Polytope
Sherali-Adams Relaxations of the Matching Polytope Claire Mathieu Computer Science Department Brown University Providence, RI 091 claire@cs.brown.edu Alistair Sinclair Computer Science Division University
CURRICULUM VITAE. Mariya Lizunova.
CURRICULUM VITAE Mariya Lizunova mary.lizunova@gmail.com, m.a.lizunova@uu.nl PERSONAL DETAILS Full Name: Mariya Andreevna Lizunova Sex: Female Date of Birth: 19 July 1993 Nationality: Russian Federation
The Unique Games and Sum of Squares: A love hate relationship
Proof, beliefs, and algorithms through the lens of sum-of-squares 1 The Unique Games and Sum of Squares: A love hate relationship Sad to say, but it will be many more years, if ever before we really understand
Optimal acceptors and optimal proof systems
Optimal acceptors and optimal proof systems Edward A. Hirsch Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, St. Petersburg 191023, Russia http://logic.pdmi.ras.ru/~hirsch/ Abstract. Unless
Xiaodi Wu Assistant Professor
Xiaodi Wu Assistant Professor CSS 3247 / AVW 3257 University of Maryland, College Park, MD 20742 +1 (734) 355 7905 xwu@cs.umd.edu https://www.cs.umd.edu/~xwu/ Research interests Quantum Information and
Jugal Garg. Univ. of Illinois at Urbana-Champaign. Urbana, IL 61801, USA
Jugal Garg 209A Transportation Building +1(217)244-1757 Dept. of Industrial and Enterprise Systems Engineering jugal@illinois.edu Univ. of Illinois at Urbana-Champaign http://jugal.ise.illinois.edu Urbana,
Robust local testability of tensor products of LDPC codes
Robust local testability of tensor products of LDPC codes Irit Dinur 1, Madhu Sudan, and Avi Wigderson 3 1 Hebrew University, Jerusalem, Israel. dinuri@cs.huji.ac.il Massachusetts Institute of Technology,
Semantic versus syntactic cutting planes
Semantic versus syntactic cutting planes Yuval Filmus 1, Pavel Hrubeš 2, and Massimo Lauria 3 1 Institute for Advanced Study Princeton, NJ yfilmus@ias.edu 2 Institute of Mathematics of ASCR Prague, Czech
Thomas Vidick Postdoctoral Associate, MIT
Thomas Vidick Postdoctoral Associate, MIT 32 Vassar Street 02139 Cambridge MA, USA +1 (310) 735 7850 vidick@csail.mit.edu people.csail.mit.edu/vidick Nationality: Belgium Born: 07/13/1982 Research interests
On Pseudorandom Generators with Linear Stretch in NC 0
On Pseudorandom Generators with Linear Stretch in NC 0 Benny Applebaum, Yuval Ishai, and Eyal Kushilevitz Computer Science Department, Technion, Haifa 32000, Israel {abenny,yuvali,eyalk}@technion.ac.il
CURRICULUM VITAE. Natalia Ivanova
CURRICULUM VITAE Natalia Ivanova Assistant Professor of Physics Email: nata.ivanova@ualberta.ca Dept. of Physics Office: +1 (780) 248-1899 University of Alberta FAX: +1 (780) 492-0714 CEB, 11322-89 Ave