The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "SAT"( http://dblp.L3S.de/Venues/SAT )

URL (DBLP): http://dblp.uni-trier.de/db/conf/sat

Publication years (Num. hits)
2003 (38) 2004 (50) 2005 (43) 2006 (40) 2007 (37) 2008 (28) 2009 (48) 2010 (38) 2011 (38) 2012 (55) 2013 (35) 2014 (34) 2015 (31) 2016 (37) 2017 (31) 2018 (28) 2019 (29)
Publication types (Num. hits)
inproceedings(623) proceedings(17)
Venues (Conferences, Journals, ...)
SAT(640)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 45 occurrences of 37 keywords

Results
Found 640 publication records. Showing 640 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Joshua Blinkhorn, Olaf Beyersdorff Proof Complexity of QBF Symmetry Recomputation. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sibylle Möhle, Armin Biere Backing Backtracking. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nina Narodytska, Aditya A. Shrotri, Kuldeep S. Meel, Alexey Ignatiev, João Marques-Silva Assessing Heuristic Machine Learning Explanations with Model Counting. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mikolás Janota, Inês Lynce (eds.) Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nikhil Vyas 0001, Ryan Williams On Super Strong ETH. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan Short Proofs in QBF Expansion. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Leroy Chew, Judith Clymo The Equivalences of Refutational QRAT. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Florent Capelli Knowledge Compilation Languages as Proof Systems. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mate Soos, Raghav Kulkarni, Kuldeep S. Meel CrystalBall: Gazing in the Black Box of SAT Solving. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Leander Tentrup, Markus N. Rabe Clausal Abstraction for DQBF. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniel Selsam, Nikolaj Bjørner Guiding High-Performance SAT Solvers with Unsat-Core Predictions. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alex Ozdemir, Aina Niemetz, Mathias Preiner, Yoni Zohar, Clark W. Barrett DRAT-based Bit-Vector Proofs in CVC4. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Florian Lonsing, Uwe Egly QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1António Morgado, Alexey Ignatiev, Maria Luisa Bonet, João Marques-Silva, Sam Buss DRMaxSAT with MaxHS: First Contact. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Stefan Mengel, Romain Wallon Revisiting Graph Width Measures for CNF-Encodings. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Massimo Lauria Circular (Yet Sound) Proofs. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marijn J. H. Heule, Manuel Kauers, Martina Seidl Local Search for Fast Matrix Multiplication. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benjamin Kiesl, Martina Seidl QRAT Polynomially Simulates ∀ \text -Exp+Res. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Carlos Mencía, Oliver Kullmann, Alexey Ignatiev, João Marques-Silva On Computing the Union of MUSes. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Proof Complexity of Fragments of Long-Distance Q-Resolution. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Combining Resolution-Path Dependencies with Dependency Learning. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Akhil A. Dixit, Phokion G. Kolaitis A SAT-Based System for Consistent Query Answering. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sam Buss, Neil Thapen DRAT Proofs, Propagation Redundancy, and Extended Resolution. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Oleksii Omelchenko, Andrei A. Bulatov Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Randy Hickey, Fahiem Bacchus Speeding Up Assumption-Based SAT. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andres Nötzli, Andrew Reynolds, Haniel Barbosa, Aina Niemetz, Mathias Preiner, Clark W. Barrett, Cesare Tinelli Syntax-Guided Rewrite Rule Enumeration for SMT Solvers. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andy Shih, Adnan Darwiche, Arthur Choi Verifying Binarized Neural Networks by Angluin-Style Learning. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Katalin Fazekas, Armin Biere, Christoph Scholl Incremental Inprocessing in SAT Solving. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sima Jamali, David Mitchell Simplifying CDCL Clause Database Reduction. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Zayd Hammoudeh, Panos Theodoropoulos Fast and Flexible Probabilistic Model Counting. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martin Suda 0001, Bernhard Gleiss Local Soundness for QBF Calculi. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tobias Paxian, Sven Reimer, Bernd Becker 0001 Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessandro Cimatti, Alberto Griggio, Ahmed Irfan, Marco Roveri, Roberto Sebastiani Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexey Ignatiev, António Morgado, João Marques-Silva PySAT: A Python Toolkit for Prototyping with SAT Oracles. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Ralf Rothenberger Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Svyatoslav Korneev, Nina Narodytska, Luca Pulina, Armando Tacchella, Nikolaj Bjørner, Mooly Sagiv Constrained Image Generation Using Binarized Neural Networks with Decision Procedures. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Lampis, Stefan Mengel, Valia Mitsou QBF as an Alternative to Courcelle's Theorem. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Hoda Abbasizanjani, Oliver Kullmann Minimal Unsatisfiability and Minimal Strongly Connected Digraphs. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mikolás Janota Circuit-Based Search Space Pruning in QBF. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Shubhani Gupta, Aseem Saxena, Anmol Mahajan, Sorav Bansal Effective Use of SMT Solvers for Program Equivalence Checking Through Invariant-Sketching and Query-Decomposition. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rüdiger Ehlers, Francisco Palau Romero Approximately Propagation Complete and Conflict Propagating Constraint Encodings. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran Exploiting Treewidth for Projected Model Counting and Its Limits. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jia Hui Liang, Chanseok Oh, Minu Mathew, Ciza Thomas, Chunxiao Li, Vijay Ganesh Machine Learning-Based Restart Policy for CDCL SAT Solvers. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christoph Scholl, Ralf Wimmer Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications - Extended Abstract. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nicola Galesi, Navid Talebanfard, Jacobo Torán Cops-Robber Games and the Resolution of Tseitin Formulas. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Christoph M. Wintersteiger (eds.) Theory and Applications of Satisfiability Testing - SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ryan Berryhill, Alexander Ivrii, Andreas G. Veneris Finding All Minimal Safe Inductive Sets. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stepan Kochemazov, Oleg Zaikin 0002 ALIAS: A Modular Tool for Finding Backdoors for SAT. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Zayd S. Hammoudeh, Panos Theodoropoulos Fast Sampling of Perfectly Uniform Satisfying Assignments. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sima Jamali, David Mitchell Centrality-Based Improvements to CDCL Heuristics. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexander Nadel Solving MaxSAT with Bit-Vector Optimization. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sean A. Weaver, Hannah J. Roberts, Michael J. Smith 0012 XOR-Satisfiability Set Membership Filters. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Manuel Kauers, Martina Seidl Symmetries of Quantified Boolean Formulas. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Polynomial-Time Validation of QCDCL Certificates. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexander Nadel, Vadim Ryvchin Chronological Backtracking. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Guillaume Baud-Berthier, Jesús Giráldez-Cru, Laurent Simon On the Community Structure of Bounded Model Checking SAT Problems. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Martin Jonás, Jan Strejcek On Simplification of Formulas with Unconstrained Variables and Quantifiers. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Benjamin Kiesl, Marijn J. H. Heule, Martina Seidl A Little Blocked Literal Goes a Long Way. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dmitry Itsykson, Alexander Knop Hard Satisfiable Formulas for Splittings by Linear Combinations. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Markus N. Rabe A Resolution-Style Proof System for DQBF. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Petr Kucera, Petr Savický, Vojtech Vorel A Lower Bound on CNF Encodings of the At-Most-One Constraint. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Bishoksan Kafle, Graeme Gange, Peter Schachte, Harald Søndergaard, Peter J. Stuckey A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Panos Theodoropoulos Probabilistic Model Counting with Short XORs. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alessandro Previti, Carlos Mencía, Matti Järvisalo, João Marques-Silva Improving MCS Enumeration via Caching. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alexey Ignatiev, António Morgado, João Marques-Silva On Tackling the Limits of Resolution in SAT Solving. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Stefan Szeider New Width Parameters for Model Counting. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Neha Lodha, Sebastian Ordyniak, Stefan Szeider SAT-Encodings for Special Treewidth and Pathwidth. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Toby Walsh (eds.) Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jia Hui Liang, Hari Govind V. K., Pascal Poupart, Krzysztof Czarnecki, Vijay Ganesh An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Saeed Nejati, Zack Newsham, Joseph Scott, Jia Hui Liang, Catherine H. Gebotys, Pascal Poupart, Vijay Ganesh A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Antti E. J. Hyvärinen, Sepideh Asadi, Karine Even-Mendoza, Grigory Fedyukovich, Hana Chockler, Natasha Sharygina Theory Refinement for Program Verification. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tuukka Korhonen, Jeremias Berg, Paul Saikko, Matti Järvisalo MaxPre: An Extended MaxSAT Preprocessor. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker 0001 From DQBF to QBF by Dependency Elimination. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Joshua Blinkhorn, Olaf Beyersdorff Shortening QBF Proofs with Dependency Schemes. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals CNFgen: A Generator of Crafted Benchmarks. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon PaInleSS: A Framework for Parallel SAT Solving. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Hidetomo Nabeshima, Katsumi Inoue Coverage-Based Clause Reduction Heuristics for CDCL Solvers. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary A Distributed Version of Syrup. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jo Devriendt, Bart Bogaerts 0001, Maurice Bruynooghe Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Eldan Cohen, Guoyu Huang, J. Christopher Beck (I Can Get) Satisfaction: Preference-Based Scheduling for Concert-Goers at Multi-venue Music Festivals. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Dependency Learning for QBF. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Miguel Terra-Neves, Inês Lynce, Vasco M. Manquinho Introducing Pareto Minimal Correction Subsets. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen An Adaptive Prefix-Assignment Technique for Symmetry Reduction. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Johannes Klaus Fichte, Neha Lodha, Stefan Szeider SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Peter Lammich The GRAT Tool Chain - Efficient (UN)SAT Certificate Checking with Formal Correctness Guarantees. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Backdoor Treewidth for SAT. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Long Distance Q-Resolution with Dependency Schemes. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Gilles Audemard, Laurent Simon Extreme Cases in SAT Problems. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda 0001 Lifting QBF Resolution Calculi to DQBF. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Lorenzo Candeago, Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio Speeding up the Constraint-Based Method in Difference Logic. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Carlos Mencía, Alexey Ignatiev, Alessandro Previti, João Marques-Silva MCS Extraction with Sublinear Oracle Queries. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Vsevolod Oparin Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Valeriy Balabanov, Jie-Hong Roland Jiang, Christoph Scholl, Alan Mishchenko, Robert K. Brayton 2QBF: Challenges and Solutions. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ralf Wimmer, Christoph Scholl, Karina Wimmer, Bernd Becker 0001 Dependency Schemes for DQBF. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Martin Jonás, Jan Strejcek Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nathan Mull, Daniel J. Fremont, Sanjit A. Seshia On the Hardness of SAT with Community Structure. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 640 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license