"A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Propositional and Predicate Calculus A Model of Argument	Derek Goldrei MA, MSc (auth.)	2005	Springer-Verlag London
Propositional and Predicate Calculus: A Model of Argument	Derek Goldrei	2005	Springer
Propositional and Predicate Calculus: A Model of Argument	Derek Goldrei	2005	Springer London
An algorithm for inferring multivalued dependencies that works also for a subclass of propositional logic	Yehoshua Sagiv	1979	Dept. of Computer Science, University of Illinois at Urbana-Champaign
Tax incidence in a two good model	Peter A. Diamond	1977	Massachusetts Institute of Technology, Dept. of Economics
Parameterized Complexity	Rodney G. Downey; M.R. Fellows	1999	Springer New York
Parameterized Algorithms	Marek Cygan; Fedor V. Fomin; Łukasz Kowalik; Daniel Lokshtanov; Dániel Marx; Marcin Pilipczuk; Michał Pilipczuk; Saket Saurabh	1st ed. 2015	Springer International Publishing
Sheaves, Games, and Model Completions: A Categorical Approach to Nonclassical Propositional Logics	Silvio Ghilardi; M. Zawadowski	2002	Springer Netherlands
Completeness Theory for Propositional Logics	Witold A. Pogorzelski; Piotr Wojtylak	2008	Birkhäuser Basel
Faster,faster,faster	Jonah Black	2002	Avon Books
Parameterized Complexity Theory	J. Flum; M. Grohe	2006	Springer Berlin Heidelberg
The incidence of profits taxes in a neo-classical growth model	Ronald E. Grieson	1972	M.I.T.]
An algorithm for allocating artillery support in the Airland Research Model	John M. Jr Geddes	1986
Propositional Content	Peter Hanks	2015	Oxford University Press
Propositional calculus	P. H. Nidditch	1962	Routledge & Kegan Paul
Propositional calculus.	P H Nidditch	1962	Free Press of Glencoe
Algorithm derivation by transformations.	Micha Sharir	1979	Courant Institute of Mathematical Sciences, New York University
Counting by ones	Kay Robertson	2015	Rourke Educational Media
Counting by Numbers	McGough, Roger.	March 1, 1990	Viking Juvenile
Counting by 7s	Holly Goldberg Sloan	2014	Piccadilly Press Ltd
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth	Friedrich Slivovsky; Stefan Szeider	Theory and Applications of Satisfiability Testing – SAT 2020: 23rd International Conference, Alghero, Italy, July 3–10, 2020, Proceedings	Luca Pulina; Martina Seidl	1st ed. 2020	Springer International Publishing
A Faster Parameterized Algorithm for Treedepth	Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar	Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I	Javier Esparza; Pierre Fraigniaud; Thore Husfeldt; Elias Koutsoupias	2014	Springer Berlin Heidelberg
Algorithms for Propositional Model Counting	Marko Samer; Stefan Szeider	Logic for Programming, Artificial Intelligence, and Reasoning: 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings	Nachum Dershowitz; Andrei Voronkov	2007	Springer Berlin Heidelberg
A Faster Parameterized Algorithm for Group Feedback Edge Set	M. S. Ramanujan	Graph-Theoretic Concepts in Computer Science: 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers	Pinar Heggernes	1st ed. 2016	Springer Berlin Heidelberg
Minimum Conflict Free Colouring Parameterized by Treewidth	Pradeesha Ashok; Rathin Bhargava; Naman Gupta; Mohammad Khalid; Dolly Yadav	Algorithms and Discrete Applied Mathematics: 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings	Manoj Changat; Sandip Das	1st ed. 2020	Springer International Publishing
Exploiting Treewidth for Projected Model Counting and Its Limits	Johannes K. Fichte; Markus Hecher; Michael Morak; Stefan Woltran	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	Olaf Beyersdorff; Christoph M. Wintersteiger	1st ed. 2018	Springer International Publishing
Parameterized Counting Problems		Parameterized Complexity Theory	J. Flum; M. Grohe	2006	Springer Berlin Heidelberg
Parameterized Counting Problems	Catherine McCartin	Mathematical Foundations of Computer Science 2002: 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002. Proceedings	Krzysztof Diks; Wojciech Rytter	2002	Springer Berlin Heidelberg
Kernelizations for Parameterized Counting Problems	Marc Thurley	Theory and Applications of Models of Computation: 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings	Jin-Yi Cai; Barry S. Cooper; Hong Zhu	2007	Springer Berlin Heidelberg
On the Harmless Set Problem Parameterized by Treewidth	Ajinkya Gaikwad; Soumen Maity	WALCOM: Algorithms and Computation: 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings	Petra Mutzel; Md. Saidur Rahman; Slamin	1st ed. 2022	Springer International Publishing
List Chromatic Number Parameterized by Treewidth Is FPT		Combinatorial Optimization and Applications	A. Dress, et al.	2007	Springer
On Directed Feedback Vertex Set Parameterized by Treewidth	Marthe Bonamy; Łukasz Kowalik; Jesper Nederlof; Michał Pilipczuk; Arkadiusz Socała; Marcin Wrochna	Graph-Theoretic Concepts in Computer Science: 44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018, Proceedings	Andreas Brandstädt; Ekkehard Köhler; Klaus Meer	1st ed. 2018	Springer International Publishing
A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem	Yunlong Liu; Jianer Chen; Jianxin Wang	Computing and Combinatorics: 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings	Guohui Lin	2007	Springer Berlin Heidelberg
A New Probabilistic Algorithm for Approximate Model Counting	Cunjing Ge; Feifei Ma; Tian Liu; Jian Zhang; Xutong Ma	Automated Reasoning: 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings	Didier Galmiche; Stephan Schulz; Roberto Sebastiani	1st ed. 2018	Springer International Publishing
Faster Parameterized Algorithms for Minor Containment	Isolde Adler; Frederic Dorn; Fedor V. Fomin; Ignasi Sau; Dimitrios M. Thilikos	Algorithm Theory - SWAT 2010: 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings	Haim Kaplan	2010	Springer Berlin Heidelberg
A Parameterized Algorithm for Mixed-Cut	Ashutosh Rai; M. S. Ramanujan; Saket Saurabh	LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings	Evangelos Kranakis; Gonzalo Navarro; Edgar Chávez	1st ed. 2016	Springer Berlin Heidelberg
A Parameterized Algorithm for Chordal Sandwich	Pinar Heggernes; Federico Mancini; Jesper Nederlof; Yngve Villanger	Algorithms and Complexity: 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010, Proceedings	Josep Diaz; Tiziana Calamoneri	2010	Springer Berlin Heidelberg
42 A Parameterized Algorithm for ISPN		Theoretical Computer Science	Guiseppe F. Italiano, Eugenio Moggi, Luigi Laura	2007	World Scientific Publishing Company
Propositional Reasoning by Model	P N Johnson-Laird; R M J Byrne; W Schaeken	Cognitive Science	Koen Lamberts	February 2008	SAGE Publications Ltd
A Propositional CONEstrip Algorithm	Erik Quaeghebeur	Information Processing and Management of Uncertainty: 15th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2014, Montpellier, France, July 15-19, 2014. Proceedings, Part III	Anne Laurent; Olivier Strauss; Bernadette Bouchon-Meunier; Ronald R. Yager	2014	Springer International Publishing
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth" - similar Books and Chapters