The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Tractability with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1974-1992 (15) 1993-1995 (21) 1996-1997 (22) 1998-1999 (25) 2000 (27) 2001 (21) 2002 (23) 2003 (29) 2004 (52) 2005 (49) 2006 (59) 2007 (65) 2008 (75) 2009 (70) 2010 (35) 2011 (29) 2012 (35) 2013 (45) 2014 (65) 2015 (35) 2016 (37) 2017 (29) 2018 (32) 2019 (44) 2020 (37) 2021 (38) 2022 (36) 2023 (44) 2024 (11)
Publication types (Num. hits)
article(527) book(1) incollection(25) inproceedings(541) phdthesis(10) proceedings(1)
Venues (Conferences, Journals, ...)
CoRR(148) J. Complex.(65) CP(24) Theor. Comput. Sci.(23) PODS(19) IJCAI(18) Artif. Intell.(15) Algorithmica(14) ICDT(14) Tractability(14) AAAI(13) CPM(13) ICALP(11) ISAAC(11) J. ACM(11) J. Comput. Syst. Sci.(11) More (+10 of total 396)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 620 occurrences of 416 keywords

Results
Found 1105 publication records. Showing 1105 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
155Erich Novak, Ian H. Sloan, Henryk Wozniakowski Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers. Search on Bibsonomy Found. Comput. Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Korobov spaces, Approximation, Randomized algorithms, Quantum computation, Tractability
92Michael Gnewuch, Henryk Wozniakowski Generalized Tractability for Multivariate Problems Part II: Linear Tensor Product Problems, Linear Information, and Unrestricted Tractability. Search on Bibsonomy Found. Comput. Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 65D99
63Fedor V. Fomin, Saket Saurabh 0001 Kernelization Methods for Fixed-Parameter Tractability. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
63Nikolaj S. Bjørner, Leonardo Mendonça de Moura Tractability and Modern Satisfiability Modulo Theories Solvers. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
63Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger 05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. Search on Bibsonomy Exact Algorithms and Fixed-Parameter Tractability The full citation details ... 2005 DBLP  BibTeX  RDF
63Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger 05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. Search on Bibsonomy Exact Algorithms and Fixed-Parameter Tractability The full citation details ... 2005 DBLP  BibTeX  RDF
59Fred J. Hickernell, Henryk Wozniakowski Integration and approximation in arbitrary dimensions. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF curse of dimension, multivariate integration, multivariate approximation, 65D05, 41A63, tractability, 41A05, 41A25
47Suvrit Sra Tractable Optimization in Machine Learning. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
47Lara Dolecek Towards Practical Graph-Based, Iteratively Decoded Channel Codes: Insights through Absorbing Sets. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
47Pushmeet Kohli Efficient Submodular Function Minimization for Computer Vision. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
47Tony Jebara Perfect Graphs and Graphical Modeling. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
47João Marques-Silva 0001, Inês Lynce SAT Solvers. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
47Andreas Krause 0001, Daniel Golovin Submodular Function Maximization. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
47Adnan Darwiche Tractable Knowledge Representation Formalisms. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
47Mohit Singh, Kunal Talwar Approximation Algorithms. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
47Georg Gottlob, Gianluigi Greco, Francesco Scarcello Treewidth and Hypertree Width. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
47 Introduction. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
47Vladimir Kolmogorov Tree-Reweighted Message Passing. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
47Peter G. Jeavons, Stanislav Zivný Tractable Valued Constraints. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
47Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger (eds.) Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005 Search on Bibsonomy Exact Algorithms and Fixed-Parameter Tractability The full citation details ... 2006 DBLP  BibTeX  RDF
46Tuan Zea Tan, Geok See Ng, Chai Quek Improving tractability of Clinical Decision Support system. Search on Bibsonomy IJCNN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
44Roded Sharan, Bjarni V. Halldórsson, Sorin Istrail Islands of Tractability for Parsimony Haplotyping. Search on Bibsonomy CSB The full citation details ... 2005 DBLP  DOI  BibTeX  RDF approximation algorithm, complexity, fixed parameter tractability, genotype, parsimony, Haplotype inference
38Thomas Eiter, Kazuhisa Makino On computing all abductive explanations from a propositional Horn theory. Search on Bibsonomy J. ACM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Horn theories, dualization problem, polynomial total-time computation, NP-hardness, Abduction, model-based reasoning, propositional logic, tractability, prime implicates, characteristic set, enumeration algorithms
38Stefan Porschen, Ewald Speckenmeyer Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. Search on Bibsonomy SAT (Selected Papers The full citation details ... 2004 DBLP  DOI  BibTeX  RDF (hidden) Horn formula, quadratic formula, minimal vertex cover, NP-completeness, satisfiability, fixed-parameter tractability
38Tak-Ming Law Fair Play Protocol. Search on Bibsonomy Active Media Technology The full citation details ... 2001 DBLP  DOI  BibTeX  RDF fairness, tractability, disputes
36Gianluigi Greco, Francesco Scarcello The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability. Search on Bibsonomy PODS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF structural decomposition methods, tree projections, local consistency
36David A. Cohen, Martin James Green, Chris Houghton Constraint Representations and Structural Tractability. Search on Bibsonomy CP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
36Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Francisco José Romero-Campero Characterizing Tractability with Membrane Creation. Search on Bibsonomy SYNASC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
36Hubie Chen, Víctor Dalmau (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. Search on Bibsonomy CP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
34Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF clustering, complexity, lower bound, dimension, fixed-parameter tractability
34Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF existential second-order logic, existential second-order formula, prefix class, first-order quantifiers, polynomial-time solvable problem, computational complexity, computational complexity, graph theory, graphs, directed graphs, NP-complete problems, formal logic, undirected graphs, descriptive complexity, tractability
34Haim Kaplan, Ron Shamir, Robert Endre Tarjan Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping Search on Bibsonomy FOCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF added edges, parameterized completion problems, minimum fill-in, NP-Hard graph completion problem, interval graphs, parameterized complexity, tractability, vertex coloring, physical mapping
31Henryk Wozniakowski Tractability and Strong Tractability of Linear Multivariate Problems. Search on Bibsonomy J. Complex. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
30Gösta Grahne, Adrian Onet Data correspondence, exchange and repair. Search on Bibsonomy ICDT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
30Yasunori Ishihara, Takuji Morimoto, Shougo Shimizu, Kenji Hashimoto, Toru Fujiwara A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes. Search on Bibsonomy DBPL The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
30Masayuki Murakami, Nakaji Honda Performance of the IDS Method as a Soft Computing Tool. Search on Bibsonomy IEEE Trans. Fuzzy Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
30Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini 0001, Charis Papadopoulos, Frances A. Rosamond Clustering with Partial Information. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond How similarity helps to efficiently compute Kemeny rankings. Search on Bibsonomy AAMAS (1) The full citation details ... 2009 DBLP  BibTeX  RDF structural parameterization, exact algorithm, NP-hard problem, fixed-parameter tractability, rank aggregation
28Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier Data reduction and exact algorithms for clique cover. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Clique cover, data reduction, fixed-parameter tractability
28Mathias Möhl, Sebastian Will, Rolf Backofen Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots. Search on Bibsonomy CPM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF RNA alignment, fixed parameter tractability, pseudoknots
28Georg Gottlob, Reinhard Pichler, Fang Wei 0001 Monadic datalog over finite structures with bounded treewidth. Search on Bibsonomy PODS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF datalog, treewidth, fixed-parameter tractability, monadic second order logic, tree decomposition
28Vincent Berry, François Nicolas Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems. Search on Bibsonomy IEEE ACM Trans. Comput. Biol. Bioinform. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF algorithms, pattern matching, trees, consensus, compatibility, fixed-parameter tractability, Phylogenetics
28Georg Gottlob, Reinhard Pichler, Fang Wei 0001 Tractable database design through bounded treewidth. Search on Bibsonomy PODS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF database design, normal forms, fixed-parameter tractability, tree decomposition, bounded treewidth
28Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter Applying Modular Decomposition to Parameterized Bicluster Editing. Search on Bibsonomy IWPEC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF edge modification problems, bicluster graphs, NP-complete problems, fixed-parameter tractability, cluster graphs
28Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. Search on Bibsonomy CIAC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF edge modification problems, data clustering, NP-complete problems, exact algorithms, fixed-parameter tractability
28Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons 0001 The complexity of maximal constraint languages. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF algebraic invariance property, constraint satisfaciton problem, relational clone, complexity, NP-completeness, tractability, constraint language
28Georg Gottlob, Francesco Scarcello, Martha Sideri Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning. Search on Bibsonomy LPNMR The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Complexity, Logic Programming, Constraint Satisfaction, Nonmonotonic Reasoning, Fixed-parameter Tractability, Stable Models, Prime Implicants, Circumscription
28Byron Dom MDL estimation for small sample sizes and its application to segmenting binary strings. Search on Bibsonomy CVPR The full citation details ... 1997 DBLP  DOI  BibTeX  RDF MDL estimation, binary strings segmentation, minimum description length estimation, sharper code-length formulas, relative tractability, binary strings, piecewise Bernoulli assumption, Bernoulli source, pattern recognition, computer vision, computer vision, small sample sizes
28Brandon Bennett, Anthony G. Cohn 0001, Amar Isli Combining Multiple Representations in a Spatial Reasoning System. Search on Bibsonomy ICTAI The full citation details ... 1997 DBLP  DOI  BibTeX  RDF spatial reasoning system, quantitative representations, numerical coordinate systems, high-level conceptual vocabulary, qualitative languages, computational tractability, first-order language, intuitionistic propositional logic, quantitative data structures, polygonal regions, qualitative relational language, high-level queries, spatial reasoning, multiple representations, topological relations, spatial information systems, qualitative representations
28James M. Butler Quantum modeling of distributed object computing. Search on Bibsonomy Annual Simulation Symposium The full citation details ... 1995 DBLP  DOI  BibTeX  RDF quantum modeling, computer engineering community, large scale design, large scale verification, LCN model, real-world network topologies, DCO model, system-independent method, complex object oriented computing structures, DCO software mapping, object system mapping model, OSM model, modeling, software engineering, design, message passing, tools, local area networks, digital simulation, object-oriented methods, client-server systems, dynamic models, large scale systems, random processes, tractability, multicomputer systems, distributed object computing, random variables, mission critical systems
28Jean-Pierre Corriveau A time-constrained architecture for cognition. Search on Bibsonomy HICSS (3) The full citation details ... 1995 DBLP  DOI  BibTeX  RDF time-constrained architecture, computational approaches, static strategy, diachronic nature, strong tractability, epistemological commitments, time-constrained model, massively parallel network, simple signals, object-oriented hierarchy, parallel architectures, knowledge based systems, software reliability, software reliability, memory, knowledge base, cognition, cognitive architectures, cognitive architecture, cognitive systems
28Lotfi A. Zadeh Soft Computing and Fuzzy Logic. Search on Bibsonomy IEEE Softw. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF low solution cost, human mind, software engineering, software engineering, fuzzy logic, fuzzy logic, robustness, uncertainty, neural nets, inference mechanisms, soft computing, probabilistic reasoning, uncertainty handling, tractability, imprecision, neurocomputing, software methodologies
28Thin-Fong Tsuei, Mary K. Vernon A Multiprocessor Bus Design Model Validated by System Measurement. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF commercial multiprocessor bus, bus design, asynchronous memorywrite operations, in-order delivery, processor read requests, memoryresponses, outstanding processor requests, two-level hierarchical model, mean value analysis techniques, measured system performance, parallel program workloads, memory access characteristics, analytic queueing models, model tractability, detailed simulation, system design tradeoffs, parallel programming, formal verification, Markov chain, Markov processes, queueing theory, multiprocessing systems, queueing networks, system buses, priority scheduling, performanceevaluation, system measurement
26Binhai Zhu Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx Minimizing Movement: Fixed-Parameter Tractability. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26Bruno Marnette Generalized schema-mappings: from termination to tractability. Search on Bibsonomy PODS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF weak acyclicity, data exchange, core, universal solution
26Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. Search on Bibsonomy IEEE ACM Trans. Comput. Biol. Bioinform. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Biology and genetics, Combinatorial algorithms, Complexity hierarchies
26Roman Barták, Ondrej Cepek Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. Search on Bibsonomy AIMSA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF temporal networks, complexity, alternatives, constraint models
26Roded Sharan, Bjarni V. Halldórsson, Sorin Istrail Islands of Tractability for Parsimony Haplotyping. Search on Bibsonomy IEEE ACM Trans. Comput. Biol. Bioinform. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF graph algorithms, Biology and genetics, analysis of algorithms and problem complexity
26Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. Search on Bibsonomy CIAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26Chris Houghton, David A. Cohen, Martin James Green The Effect of Constraint Representation on Structural Tractability. Search on Bibsonomy CP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. Search on Bibsonomy WABI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26Frank K. H. A. Dehne FPT at Work: Using Fixed Parameter Tractability to Solve Larger Instances of Hard Problems. Search on Bibsonomy IWPEC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001 Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual. Search on Bibsonomy IWPEC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26Martin Scholz On the Tractability of Rule Discovery from Distributed Data. Search on Bibsonomy ICDM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Marion G. Ceruti, Stuart Harvey Rubin Infodynamics III: Information Integration and Tractability. Search on Bibsonomy IRI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Hubie Chen, Víctor Dalmau From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. Search on Bibsonomy CSL The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Richard Gault, Peter Jeavons 0001 Implementing a Test for Tractability. Search on Bibsonomy Constraints An Int. J. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Polyanna, complexity, polymorphism, symmetry, constraint language
26Jörg Flum, Martin Grohe, Mark Weyer Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
26Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Toby Walsh The Tractability of Global Constraints. Search on Bibsonomy CP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
26Mark Weyer Bounded Fixed-Parameter Tractability: The Case 2poly(k). Search on Bibsonomy IWPEC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
20Marek Karpinski, Andrzej Rucinski 0001, Edyta Szymanska The Complexity of Perfect Matching Problems on Dense Hypergraphs. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
20Andrea Calì, Georg Gottlob, Andreas Pieris Tractable Query Answering over Conceptual Schemata. Search on Bibsonomy ER The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
20Foto N. Afrati, Phokion G. Kolaitis Repair checking in inconsistent databases: algorithms and complexity. Search on Bibsonomy ICDT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF coNP-complete problem, equality-generating dependencies, repair checking, tuple-generating dependencies, weakly acyclic set, polynomial time, consistent query answering, inconsistent databases, database repairs
20Sue Whitesides Intractability in Graph Drawing and Geometry: FPT Approaches. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
20Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran Fast Counting with Bounded Treewidth. Search on Bibsonomy LPAR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
20Francesco Scarcello, Georg Gottlob, Gianluigi Greco Uniform Constraint Satisfaction Problems and Database Theory. Search on Bibsonomy Complexity of Constraints The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
20Luca Trevisan Average-case Complexity. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
20Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe Copeland Voting Fully Resists Constructive Control. Search on Bibsonomy AAIM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Computational social choice theory, multiagent systems, preference aggregation
20Vibhore Kumar, Brian F. Cooper, Greg Eisenhauer, Karsten Schwan iManage: Policy-Driven Self-management for Enterprise-Scale Systems. Search on Bibsonomy Middleware The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Bayesian Networks, Policies, Self-Management, Enterprise-Systems
20Benny Kimelfeld, Yehoshua Sagiv Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries. Search on Bibsonomy NGITS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
20Patrick Bosc, Olivier Pivert About projection-selection-join queries addressed to possibilistic relational databases. Search on Bibsonomy IEEE Trans. Fuzzy Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
20Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien Tractable Clones of Polynomials over Semigroups. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
20Andrei A. Krokhin, Benoît Larose Maximum Constraint Satisfaction on Diamonds. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
20Phokion G. Kolaitis Constraint Satisfaction, Complexity, and Logic. Search on Bibsonomy SETN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
20Wiebe van der Hoek, Michael J. Wooldridge Cooperation, Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications. Search on Bibsonomy Stud Logica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Cooperation logic, model checking, game theory, epistemic logic
20Michael J. Wooldridge Time, Knowledge, and Cooperation: Alternating-Time Temporal Epistemic Logic and Its Applications. Search on Bibsonomy KI The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
20Michael J. Wooldridge, Wiebe van der Hoek Time, Knowledge, and Cooperation: Alternating-Time Temporal Epistemic Logic and Its Applications. Search on Bibsonomy COORDINATION The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
20Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. Search on Bibsonomy CP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
20Richard Butterworth, Ann Blandford, David J. Duke Demonstrating the Cognitive Plausibility of Interactive System Specifications. Search on Bibsonomy Formal Aspects Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Programmable User Modelling (PUM), Cognitive plausibility, Electronic diary systems, Human-Computer Interaction (HCI), Interactive systems, Formal modelling
20Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons 0001 Constraint Satisfaction Problems and Finite Algebras. Search on Bibsonomy ICALP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
20Thomas Eiter, Thomas Lukasiewicz New Tractable Cases in Default Reasoning from Conditional Knowledge Bases. Search on Bibsonomy JELIA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
20Juraj Hromkovic Stability of Approximation Algorithms for Hard Optimization Problems. Search on Bibsonomy SOFSEM The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
20Michael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege Analogs and Duals of the MAST Problem for Sequences and Trees. Search on Bibsonomy ESA The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
20Latha S. Colby, Leonid Libkin Tractable Iteration Mechanisms for Bag Languages. Search on Bibsonomy ICDT The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
18Dániel Marx Tractable hypergraph properties for constraint satisfaction and conjunctive queries. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF submodular width, constraint satisfaction, conjunctive queries, fixed-parameter tractability
18Dániel Marx Completely Inapproximable Monotone and Antimonotone Parameterized Problems. Search on Bibsonomy CCC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF parameterized comlexity, approximation, fixed-parameter tractability, inapproximability
18Grzegorz W. Wasilkowski, Henryk Wozniakowski Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Average Case Setting. Search on Bibsonomy Found. Comput. Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Multivariate linear problems, Finite-order weights, Small effective dimension, Average case setting, Polynomial-time algorithms, Tractability
18Jianer Chen, Yang Liu 0002, Songjian Lu An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Multiway cut problem, Network flow, Fixed-parameter tractability, Minimum cut, Parameterized algorithm
18Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter Applying Modular Decomposition to Parameterized Cluster Editing Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Edge modification problems, Bicluster graphs, NP-complete problems, Fixed-parameter tractability, Cluster graphs
Displaying result #1 - #100 of 1105 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license