Go to the corresponding LIPIcs Volume Portal 
Beame, Paul ; Fleming, Noah ; Impagliazzo, Russell ; Kolokolova, Antonina ; Pankratov, Denis ; Pitassi, Toniann ; Robere, Robert
pdfformat: 

@InProceedings{beame_et_al:LIPIcs:2018:8341, author = {Paul Beame and Noah Fleming and Russell Impagliazzo and Antonina Kolokolova and Denis Pankratov and Toniann Pitassi and Robert Robere}, title = {{Stabbing Planes}}, booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)}, pages = {10:110:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770606}, ISSN = {18688969}, year = {2018}, volume = {94}, editor = {Anna R. Karlin}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8341}, URN = {urn:nbn:de:0030drops83418}, doi = {10.4230/LIPIcs.ITCS.2018.10}, annote = {Keywords: Complexity Theory, Proof Complexity, Communication Complexity, Cutting Planes, SemiAlgebraic Proof Systems, Pseudo Boolean Solvers, SAT solvers, Inte} }
Keywords:  Complexity Theory, Proof Complexity, Communication Complexity, Cutting Planes, SemiAlgebraic Proof Systems, Pseudo Boolean Solvers, SAT solvers, Inte  
Seminar:  9th Innovations in Theoretical Computer Science Conference (ITCS 2018)  
Issue Date:  2018  
Date of publication:  05.01.2018 