The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Peter Jonsson" ( http://dblp.L3S.de/Authors/Peter_Jonsson )

URL (Homepage):  http://www.ida.liu.se/~petej/  Author page on DBLP  Author page in RDF  Community of Peter Jonsson in ASPL-2

Publication years (Num. hits)
1994-1998 (19) 1999-2001 (16) 2002-2004 (19) 2005-2007 (15) 2008-2010 (15) 2011-2012 (16) 2013-2014 (17) 2015-2016 (18) 2017-2018 (19) 2019 (1)
Publication types (Num. hits)
article(87) incollection(1) inproceedings(67)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 33 occurrences of 20 keywords

Results
Found 157 publication records. Showing 155 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs. Search on Bibsonomy IJCAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Peter Jonsson Constants and finite unary relations in qualitative constraint reasoning. Search on Bibsonomy Artif. Intell. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Johan Thapper Tractability conditions for numeric CSPs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Barnaby Martin, Peter Jonsson, Manuel Bodirsky, Antoine Mottet Classification transfer for qualitative reasoning problems. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Marco Kuhlmann, Giorgio Satta, Peter Jonsson On the Complexity of CCG Parsing. Search on Bibsonomy Computational Linguistics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rachele Anderson, Peter Jönsson, Maria Sandsten Insights on Spectral Measures for HRV Based on a Novel Approach for Data Acquisition. Search on Bibsonomy EMBC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Victor Lagerkvist Why are CSPs Based on Partition Schemes Computationally Hard?. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rachele Anderson, Peter Jönsson, Maria Sandsten Effects of Age, BMI, Anxiety and Stress on the Parameters of a Stochastic Model for Heart Rate Variability Including Respiratory Information. Search on Bibsonomy BIOSIGNALS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs. Search on Bibsonomy SOCS The full citation details ... 2018 DBLP  BibTeX  RDF
1Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet Classification Transfer for Qualitative Reasoning Problems. Search on Bibsonomy IJCAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak Novel Structural Parameters for Acyclic Planning Using Tree Embeddings. Search on Bibsonomy IJCAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Manuel Bodirsky, Peter Jonsson, Van Trung Pham The Complexity of Phylogeny Constraint Satisfaction Problems. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Victor Lagerkvist An initial study of time complexity in infinite-domain constraint satisfaction. Search on Bibsonomy Artif. Intell. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Peter Jonsson, Barnaby Martin Circuit satisfiability and constraint satisfaction around Skolem Arithmetic. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini Strong partial clones and the time complexity of SAT problems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson Time and Space Bounds for Planning. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Manuel Bodirsky, Peter Jonsson A Model-Theoretic View on Qualitative Constraint Reasoning. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marco Kuhlmann, Giorgio Satta, Peter Jonsson On the Complexity of CCG Parsing. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Peter Jonsson, Victor Lagerkvist, Biman Roy Time Complexity of Constraint Satisfaction via Universal Algebra. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Peter Jonsson, Victor Lagerkvist, Biman Roy Time Complexity of Constraint Satisfaction via Universal Algebra. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Manuel Bodirsky, Peter Jonsson, Van Trung Pham The Reducts of the homogeneous Binary Branching C-Relation. Search on Bibsonomy J. Symb. Log. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg Refining complexity analyses in planning by exploiting the exponential time hypothesis. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Johan Thapper Constraint satisfaction and semilinear expansions of addition over the rationals and the reals. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson Upper and Lower Time and Space Bounds for Planning. Search on Bibsonomy ECAI The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Peter Jonsson Finite Unary Relations and Qualitative Constraint Satisfaction. Search on Bibsonomy ECAI The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis. Search on Bibsonomy ECAI The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Manuel Bodirsky, Peter Jonsson, Van Trung Pham The Complexity of Phylogeny Constraint Satisfaction. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Peter Jonsson, Barnaby Martin Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic. Search on Bibsonomy CiE The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper An Approximability-related Parameter on Graphs - Properties and Applications. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2015 DBLP  BibTeX  RDF
1Peter Jonsson, Victor Lagerkvist, Gustav Nordh Constructing NP-intermediate problems by blowing holes with parameters of various properties. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider A complete parameterized complexity analysis of bounded planning. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Marco Kuhlmann, Peter Jonsson Parsing to Noncrossing Dependency Graphs. Search on Bibsonomy TACL The full citation details ... 2015 DBLP  BibTeX  RDF
1Peter Jonsson, Marco Kuhlmann Maximum Pagenumber-k Subgraph is NP-Complete. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Peter Jonsson, Johan Thapper Constraint Satisfaction and Semilinear Expansions of Addition over the Rationals and the Reals. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Christian Glaßer, Peter Jonsson, Barnaby Martin Constraint Satisfaction Problems around Skolem Arithmetic. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Manuel Bodirsky, Peter Jonsson, Van Trung Pham The Complexity of Phylogeny Constraint Satisfaction. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Meysam Aghighi, Peter Jonsson, Simon Ståhlberg Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs. Search on Bibsonomy AAAI The full citation details ... 2015 DBLP  BibTeX  RDF
1Peter Jonsson, Victor Lagerkvist Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs. Search on Bibsonomy CP The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Anders Jonsson, Peter Jonsson, Tomas Lööw Limitations of acyclic causal graphs for planning. Search on Bibsonomy Artif. Intell. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Anders Jonsson, Peter Jonsson Automaton Plans. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Peter Jonsson, Victor Lagerkvist, Johannes Schmidt 0001, Hannes Uppman Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Christer Bäckström, Peter Jonsson Algorithms and Limits for Compact Plan Representations. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Peter Jonsson, Victor Lagerkvist, Johannes Schmidt 0001, Hannes Uppman Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. Search on Bibsonomy MFCS (2) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Johan Thapper Affine Consistency and the Complexity of Semilinear Constraints. Search on Bibsonomy MFCS (2) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Meysam Aghighi, Peter Jonsson Oversubscription Planning: Complexity and Compilability. Search on Bibsonomy AAAI The full citation details ... 2014 DBLP  BibTeX  RDF
1Peter Jonsson, Tomas Lööw Computational complexity of linear constraints over the integers. Search on Bibsonomy Artif. Intell. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider A Complete Parameterized Complexity Analysis of Bounded Planning. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. Search on Bibsonomy SODA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider Parameterized Complexity and Kernel Bounds for Hard Planning Problems. Search on Bibsonomy CIAC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Victor Lagerkvist, Gustav Nordh Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction. Search on Bibsonomy CP The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Anders Jonsson, Peter Jonsson, Tomas Lööw When Acyclicity Is Not Enough: Limitations of the Causal Graph. Search on Bibsonomy ICAPS The full citation details ... 2013 DBLP  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Simon Ståhlberg Fast Detection of Unsolvable Planning Instances Using Local Consistency. Search on Bibsonomy SOCS The full citation details ... 2013 DBLP  BibTeX  RDF
1Christer Bäckström, Peter Jonsson Bridging the Gap Between Refinement and Heuristics in Abstraction. Search on Bibsonomy IJCAI The full citation details ... 2013 DBLP  BibTeX  RDF
1Christer Bäckström, Peter Jonsson Algorithms and Limits for Compact Plan Representations. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Manuel Bodirsky, Peter Jonsson, Timo von Oertzen Essential Convexity and Complexity of Semi-Algebraic Constraints Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider Parameterized Complexity and Kernel Bounds for Hard Planning Problems Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider The Complexity of Planning Revisited - A Parameterized Analysis Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Manuel Bodirsky, Peter Jonsson, Timo von Oertzen Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction. Search on Bibsonomy J. Log. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider The Complexity of Planning Revisited - A Parameterized Analysis. Search on Bibsonomy AAAI The full citation details ... 2012 DBLP  BibTeX  RDF
1Christer Bäckström, Anders Jonsson, Peter Jonsson Macros, Reactive Plans and Compact Representations. Search on Bibsonomy ECAI The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Anders Jonsson, Peter Jonsson From Macro Plans to Automata Plans. Search on Bibsonomy ECAI The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson Abstracting Abstraction in Search with Applications to Planning. Search on Bibsonomy KR The full citation details ... 2012 DBLP  BibTeX  RDF
1Christer Bäckström, Peter Jonsson Abstracting Abstraction in Search II: Complexity Analysis. Search on Bibsonomy SOCS The full citation details ... 2012 DBLP  BibTeX  RDF
1Mattias Wallergård, Peter Jönsson, Kai Österberg, Gerd Johansson, Björn Karlson A Virtual Reality Version of the Trier Social Stress Test: A Pilot Study. Search on Bibsonomy Presence The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Fredrik Kuivinen, Johan Thapper Min CSP on Four Elements: Moving Beyond Submodularity Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Peter Jonsson, Fredrik Kuivinen, Johan Thapper Min CSP on Four Elements: Moving beyond Submodularity. Search on Bibsonomy CP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson Limits for Compact Representation of Plans. Search on Bibsonomy ICAPS The full citation details ... 2011 DBLP  BibTeX  RDF
1Christer Bäckström, Peter Jonsson All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others. Search on Bibsonomy SOCS The full citation details ... 2011 DBLP  BibTeX  RDF
1Peter Jonsson, Tomas Lööw Discrete-Time Temporal Reasoning with Horn DLRs. Search on Bibsonomy IJCAI The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Johan Thapper Approximating integer programs with positive right-hand sides. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh Retractions to Pseudoforests. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Gustav Nordh Approximability of Clausal Constraints. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Manuel Bodirsky, Peter Jonsson, Timo von Oertzen Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper Properties of an Approximability-related Parameter on Circular Complete Graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen Hard constraint satisfaction problems have hard gaps at location 1. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Manuel Bodirsky, Peter Jonsson, Timo von Oertzen Semilinear Program Feasibility. Search on Bibsonomy ICALP (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Johan Thapper Approximability of the Maximum Solution Problem for Certain Families of Algebras. Search on Bibsonomy CSR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF computational complexity, approximability, Optimisation, constraint satisfaction, algebra
1Tommy Färnqvist, Peter Jonsson, Johan Thapper Approximability Distance in the Space of H-Colourability Problems. Search on Bibsonomy CSR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF graph H-colouring, computational complexity, approximability, optimisation, graph homomorphism
1Peter Jonsson, Andrei A. Krokhin Computational complexity of auditing finite attributes in statistical databases. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin The approximability of MAX CSP with fixed-value constraints. Search on Bibsonomy J. ACM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Complexity of approximation, maximum constraint satisfaction, dichotomy, Monge properties, supermodularity
1Tommy Färnqvist, Peter Jonsson, Johan Thapper Approximability Distance in the Space of H-Colourability Problems Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Peter Jonsson, Fredrik Kuivinen, Gustav Nordh MAX ONES Generalized to Larger Domains. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Gustav Nordh Introduction to the Maximum SolutionProblem. Search on Bibsonomy Complexity of Constraints The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Andrei A. Krokhin Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen Hard constraint satisfaction problems have hard gaps at location 1 Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Maria Hansson-Sandsten, Peter Jönsson Multiple Window Correlation Analysis of HRV Power and Respiratory Frequency. Search on Bibsonomy IEEE Trans. Biomed. Engineering The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Tommy Färnqvist, Peter Jonsson Bounded Tree-Width and CSP-Related Problems. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Computational complexity, constraint satisfaction, homomorphism, inapproximability, relational structure
1Sigrid Eldh, Sasikumar Punnekkat, Hans Hansson, Peter Jönsson Component Testing Is Not Enough - A Study of Software Faults in Telecom Middleware. Search on Bibsonomy TestCom/FATES The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Fault distribution, Testing, Software, Fault Classification
1Peter Jonsson, Gustav Nordh, Johan Thapper The Maximum Solution Problem on Graphs. Search on Bibsonomy MFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF computational complexity, optimisation, Constraint satisfaction, homomorphisms
1Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems. Search on Bibsonomy CSR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF maximum constraint satisfaction, complexity, approximability
1Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin The approximability of MAX CSP with fixed-value constraints Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Peter Jonsson, Fredrik Kuivinen, Gustav Nordh Approximability of Integer Programming with Generalised Constraints Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Peter Jonsson, Mikael Klasson, Andrei A. Krokhin The Approximability of Three-valued MAX CSP. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Gustav Nordh Generalised Integer Programming Based on Logically Defined Relations. Search on Bibsonomy MFCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Fredrik Kuivinen, Gustav Nordh Approximability of Integer Programming with Generalised Constraints. Search on Bibsonomy CP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Thomas Drakengren, Peter Jonsson Computational Complexity of Temporal Constraint Problems. Search on Bibsonomy Handbook of Temporal Reasoning in Artificial Intelligence The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström Counting models for 2SAT and 3SAT formulae. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 155 (100 per page; Change: )
Pages: [1][2][>>]
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