The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1958-1989 (17) 1990-1993 (15) 1994-1997 (16) 1998-2000 (21) 2001-2002 (23) 2003-2004 (24) 2005 (24) 2006 (25) 2007 (19) 2008 (22) 2009 (16) 2010-2014 (17) 2015-2019 (15) 2020-2024 (12)
Publication types (Num. hits)
article(105) incollection(1) inproceedings(159) phdthesis(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 191 occurrences of 174 keywords

Results
Found 266 publication records. Showing 266 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
48Stefan Felsner, William T. Trotter Dimension, Graph and Hypergraph Coloring. Search on Bibsonomy Order The full citation details ... 2000 DBLP  DOI  BibTeX  RDF dimension, chromatic number
45Lakshmanan Kuppusamy, Kamala Krithivasan On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations. Search on Bibsonomy ICTAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF internal contextual grammars, maximal, incomparable, depth-first
36Elvira Mayordomo, Philippe Moser Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression. Search on Bibsonomy SOFSEM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF plogon, Lempel-Ziv algorithm, pushdown compression, computational complexity, compression algorithms, data stream algorithms
36Simona Orzan, Muhammad Torabi Dashti Fair Exchange Is Incomparable to Consensus. Search on Bibsonomy ICTAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
36Mark Nicholas Charles Rhodes Resolution Width and Cutting Plane Rank Are Incomparable. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Cutting Plane Proofs, Rank Lower Bounds, Resolution Width, Propositional Proof Complexity
36Elvis Papalilo, Bernd Freisleben Combining Incomparable Public Session Keys and Certificateless Public Key Cryptography for Securing the Communication Between Grid Participants. Search on Bibsonomy OTM Conferences (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
36Brent R. Waters, Edward W. Felten, Amit Sahai Receiver anonymity via incomparable public keys. Search on Bibsonomy CCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF privacy, anonymity, public key cryptography, PGP
36Peyman Faratin, Bartel A. Van de Walle Agent preference relations: strict, indifferent and incomparable. Search on Bibsonomy AAMAS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF (Fuzzy) multi criteria decision making, multi-agent systems, incomparability
33Rita V. Rodríguez A relativistic temporal algebra for efficient design of distributed systems. Search on Bibsonomy Appl. Intell. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF Atomic relation, incomparable events, interval temporal model, relativistic space-time, temporal algebra, distributed system, relation algebra
25Sasank Mouli Polynomial Calculus sizes over the Boolean and Fourier bases are incomparable. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
25Sasank Mouli Polynomial Calculus sizes over the Boolean and Fourier bases are incomparable. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
25Ter-Chan Row, Yen-Liang Pan Incomparable Single Controller for Solving Deadlock Problems of Flexible Manufacturing Systems. Search on Bibsonomy IEEE Access The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Dodamgodage Gihanee M. Senadheera Effective Concept Classes of PAC and PACi Incomparable Degrees, Joins and Embedding of Degrees. Search on Bibsonomy Bull. Symb. Log. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Teng Zhang Incomparable V γ $V_\gamma$ -degrees. Search on Bibsonomy Math. Log. Q. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Andreas Maletti, Andreea-Teodora Nász Weighted Bottom-Up and Top-Down Tree Transformations Are Incomparable. Search on Bibsonomy CIAA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Gül Deniz Çayli Construction of Uninorms on Bounded Lattices with Incomparable Elements that are Neither Conjunctive Nor Disjunctive. Search on Bibsonomy Int. J. Uncertain. Fuzziness Knowl. Based Syst. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
25Mokhtar Z. Alaya, Gilles Gasso, Maxime Berar, Alain Rakotomamonjy Distributional Sliced Embedding Discrepancy for Incomparable Distributions. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
25Samuel Cohen, Giulia Luise, Alexander Terenin, Brandon Amos, Marc Peter Deisenroth Aligning Time Series on Incomparable Spaces. Search on Bibsonomy AISTATS The full citation details ... 2021 DBLP  BibTeX  RDF
25Samuel Cohen, Giulia Luise, Alexander Terenin, Brandon Amos, Marc Peter Deisenroth Aligning Time Series on Incomparable Spaces. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
25Titouan Vayer A contribution to Optimal Transport on incomparable spaces. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
25Titouan Vayer A contribution to Optimal Transport on incomparable spaces. (Une contribution au Transport Optimal sur des espaces incomparables). Search on Bibsonomy 2020   RDF
25Charlotte Bunne, David Alvarez-Melis, Andreas Krause 0001, Stefanie Jegelka Learning Generative Models across Incomparable Spaces. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
25Tadeusz Litak, Albert Visser Lewisian Fixed Points I: Two Incomparable Constructions. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
25David M. Howard 0002, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang Dimension of posets with planar cover graphs excluding two long incomparable chains. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
25Yunxia Zhang, Degen Huang, Wei Gao, Vassilis G. Kaburlasos A Decision Making Approach with Linguistic Weight and Unavoidable Incomparable Ranking. Search on Bibsonomy Int. J. Comput. Intell. Syst. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
25Charlotte Bunne, David Alvarez-Melis, Andreas Krause 0001, Stefanie Jegelka Learning Generative Models across Incomparable Spaces. Search on Bibsonomy ICML The full citation details ... 2019 DBLP  BibTeX  RDF
25Yin Tong, Zhiwu Li 0001, Carla Seatzu, Alessandro Giua Current-state opacity enforcement in discrete event systems under incomparable observations. Search on Bibsonomy Discret. Event Dyn. Syst. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Shudong Hao, Michael J. Paul Learning Multilingual Topics from Incomparable Corpus. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
25Guilherme Carmona, Konrad Podczeck The conditions in the existence results for discontinuous games by Reny and by Simon and Zame are incomparable. Search on Bibsonomy Games Econ. Behav. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Shudong Hao, Michael J. Paul Learning Multilingual Topics from Incomparable Corpora. Search on Bibsonomy COLING The full citation details ... 2018 DBLP  BibTeX  RDF
25Gunter Fuchs, Victoria Gitman, Joel David Hamkins Incomparable ω1-like models of set theory. Search on Bibsonomy Math. Log. Q. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
25Sezer Sorgun An Incomparable Upper Bound For The Largest Laplacian Graph Eigenvalue. Search on Bibsonomy Ars Comb. The full citation details ... 2017 DBLP  BibTeX  RDF
25Meena Mahajan, Anil Shukla Level-ordered Q-resolution and tree-like Q-resolution are incomparable. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
25David M. Howard 0002, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang The dimension of posets with planar cover graphs excluding two long incomparable chains. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
25Gyula O. H. Katona, Dániel T. Nagy Incomparable Copies of a Poset in the Boolean Lattice. Search on Bibsonomy Order The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
25Tania Dehesh, Najaf Zare, Seyed Mohammad Taghi Ayatollahi The Covariance Adjustment Approaches for Combining Incomparable Cox Regressions Caused by Unbalanced Covariates Adjustment: A Multivariate Meta-Analysis Study. Search on Bibsonomy Comput. Math. Methods Medicine The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
25Pavol Duris, Marek Kosta Flip-pushdown automata with k pushdown reversals and E0L systems are incomparable. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
25Yuping Shen, Xishun Zhao Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
25Yuping Shen, Xishun Zhao Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas. Search on Bibsonomy KR The full citation details ... 2014 DBLP  BibTeX  RDF
25Stefan Felsner, Tomasz Krawczyk, William T. Trotter On-Line Dimension for Posets Excluding Two Long Incomparable Chains. Search on Bibsonomy Order The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
25Vida Dujmovic, Gwenaël Joret, David R. Wood An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
25Benjamin D. Miller Incomparable Treeable Equivalence Relations. Search on Bibsonomy J. Math. Log. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
25Gwenaël Joret, Kevin G. Milans First-Fit is Linear on Posets Excluding Two Long Incomparable Chains. Search on Bibsonomy Order The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
25Hyang-Sook Lee, Seongan Lim An efficient incomparable public key encryption scheme. Search on Bibsonomy Inf. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
25Pavol Duris, Marek Kosta Flip-Pushdown Automata with k Pushdown Reversals and E0L Systems are Incomparable. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2011 DBLP  BibTeX  RDF
25Elvira Mayordomo, Philippe Moser, Sylvain Perifel Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
25Huiping Cao, K. Selçuk Candan, Maria Luisa Sapino Skynets: searching for minimum trees in graphs with incomparable edge weights. Search on Bibsonomy CIKM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
25Yoshihiro Maruyama Reasoning about Fuzzy Belief and Common Belief: With Emphasis on Incomparable Beliefs. Search on Bibsonomy IJCAI The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
25Elvira Mayordomo, Philippe Moser, Sylvain Perifel Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
25Bart Garssen Comparing the Incomparable: Figurative Analogies in a Dialectical Testing Procedure. Search on Bibsonomy Pondering on Problems of Argumentation The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
25Moubariz Z. Garaev A Quantified Version of Bourgain's Sum-Product Estimate in Fp for Subsets of Incomparable Sizes. Search on Bibsonomy Electron. J. Comb. The full citation details ... 2008 DBLP  BibTeX  RDF
25Zou Li, Da Ruan 0001, Pei Zheng, Yang Xu 0001 A linguistic truth-valued reasoning approach in decision making with incomparable information. Search on Bibsonomy J. Intell. Fuzzy Syst. The full citation details ... 2008 DBLP  BibTeX  RDF
25Jérémie Chalopin Election and rendezvous with incomparable labels. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
25Indrani Chattopadhyay, Debasis Sarkar General classes of impossible operations through the existence of incomparable states. Search on Bibsonomy Quantum Inf. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
25Amit Bhar, Indrani Chattopadhyay, Debasis Sarkar No-Cloning and No-Deleting Theorems through the Existence of Incomparable States Under LOCC. Search on Bibsonomy Quantum Inf. Process. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
25Indrani Chattopadhyay, Debasis Sarkar Deterministic local conversion of incomparable states by collective LOCC. Search on Bibsonomy Quantum Inf. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
25Yuejian Peng, Cheng Zhao On incomparable and uncomplemented families of sets. Search on Bibsonomy Australas. J Comb. The full citation details ... 2005 DBLP  BibTeX  RDF
25Rustam Mubarakzjanov Bounded-Width Probabilistic OBDDs and Read-Once Branching Programs are Incomparable Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2001 DBLP  BibTeX  RDF
25Martin Sauerhoff Randomness and Nondeterminism are Incomparable for Read-Once Branching Programs Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 1998 DBLP  BibTeX  RDF
25Levke Bentzien Positive Turing and Truth-Table Completeness for NEXP Are Incomparable. Search on Bibsonomy MFCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
25Farid M. Ablayev Randomization and nondeterminsm are incomparable for ordered read-once branching programs Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 1997 DBLP  BibTeX  RDF
25Rudolf Ahlswede, Levon H. Khachatrian Optimal pairs of incomparable clouds in multisets. Search on Bibsonomy Graphs Comb. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
25William C. Calhoun Incomparable Prime Ideals of Recursively Enumerable Degrees. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
25Marcel Erné The number of partially ordered sets with more points than incomparable pairs. Search on Bibsonomy Discret. Math. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
25Hans Hansson, Fredrik Orava A Process Calculus with Incomparable Priorities. Search on Bibsonomy NAPAW The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
25Peter C. Fishburn A note on linear extensions and incomparable pairs. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
25Zoltán Füredi, Jeff Kahn 0001, Daniel J. Kleitman Sphere coverings of the hypercube with incomparable centers. Search on Bibsonomy Discret. Math. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
25Dick Grune How to Compare the Incomparable. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
25Philip D. Welch Comparing Incomparable Kleene Degrees. Search on Bibsonomy J. Symb. Log. The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
25William S. Heck Large Families of Incomparable A-Isols. Search on Bibsonomy J. Symb. Log. The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
25Galen Weitkamp Analytic Sets Having Incomparable Kleene Degrees. Search on Bibsonomy J. Symb. Log. The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
25Saharon Shelah On uncountable Boolean algebras with no uncountable pairwise comparable or incomparable sets of elements. Search on Bibsonomy Notre Dame J. Formal Log. The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
25Richard A. Shore sigman Sets which are trianglen-Incomparable (Uniformly). Search on Bibsonomy J. Symb. Log. The full citation details ... 1974 DBLP  DOI  BibTeX  RDF
25Seymour Ginsburg, Edwin H. Spanier On Incomparable Abstract Family of Languages (AFL). Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1974 DBLP  DOI  BibTeX  RDF
25Richard Montague Theories Incomparable with Respect to Relative Interpretability. Search on Bibsonomy J. Symb. Log. The full citation details ... 1962 DBLP  DOI  BibTeX  RDF
25Clifford Spector Measure-Theoretic Construction of Incomparable Hyperdegrees. Search on Bibsonomy J. Symb. Log. The full citation details ... 1958 DBLP  DOI  BibTeX  RDF
24Zongyang Zhang, Zhenfu Cao, Rong Ma An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
24Martin Kutrib, Andreas Malcher, Detlef Wotschke The Boolean closure of linear context-free languages. Search on Bibsonomy Acta Informatica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
24Maria L. Affatato, Thomas F. Kent, Andrea Sorbi Branching in the S02{Sigma02}-enumeration degrees: a new perspective. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 03D28, 03D30
24Andreas Brandstädt, Peter Wagner 0002 On k-Versus (k+1)-Leaf Powers. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF k-leaf powers, intersection of leaf power classes, comparability of leaf power classes
24Marc Boyer, Olivier H. Roux Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets. Search on Bibsonomy ICATPN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
24Wolf-Tilo Balke, Ulrich Güntzer, Wolf Siberski Exploiting Indifference for Customization of Partial Order Skylines. Search on Bibsonomy IDEAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
24Piero A. Bonatti, Carsten Lutz, Aniello Murano, Moshe Y. Vardi The Complexity of Enriched µ-Calculi. Search on Bibsonomy ICALP (2) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
24Xiaoming Sun 0001, Runyao Duan, Mingsheng Ying The existence of quantum entanglement catalysts. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
24Francesco Ranzato, Francesco Tapparo An Abstract Interpretation Perspective on Linear vs. Branching Time. Search on Bibsonomy APLAS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
24Martin Kutrib, Andreas Malcher, Detlef Wotschke The Boolean Closure of Linear Context-Free Languages. Search on Bibsonomy Developments in Language Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
24Roman Vitenberg, Roy Friedman On the Locality of Consistency Conditions. Search on Bibsonomy DISC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
24Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro Can we elect if we cannot compare? Search on Bibsonomy SPAA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF distributed computing, mobile agents, cayley graphs, election, rendezvous, anonymous networks
24Jochen Messner On the Structure of the Simulation Order of Proof Systems. Search on Bibsonomy MFCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
24Chun Ruan, Vijay Varadharajan Resolving Conflicts in Authorization Delegations. Search on Bibsonomy ACISP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
24Christian Kuhlmann 0001 On Teaching and Learning Intersection-Closed Concept Classes. Search on Bibsonomy EuroCOLT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
24Lars Kristiansen A jump operator on honest subrecursive degrees. Search on Bibsonomy Arch. Math. Log. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
24Haim Gaifman Modeling concurrency by partial orders and nonlinear transition systems. Search on Bibsonomy REX Workshop The full citation details ... 1988 DBLP  DOI  BibTeX  RDF pomset, causal precedence, concurrent, computation, process, event, deadlock, partial order, action, state, transition system, automaton, shared resource, dining philosophers, simultaneous
12Michael Emmerich, André H. Deutz, Rui Li 0001, Johannes W. Kruisselbrink Getting lost or getting trapped: on the effect of moves toincomparable points in multiobjective hillclimbing. Search on Bibsonomy GECCO (Companion) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF markov chains, evolutionary multiobjective optimization, NSGA-ii, convergence analysis, incomparability
12Karl Bringmann, Tobias Friedrich 0001 The maximum hypervolume set yields near-optimal approximation. Search on Bibsonomy GECCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF approximation, performance measures, multiobjective optimization, hypervolume indicator
12Ragnar Normann, Lene T. Østby A theoretical study of 'Snapshot Isolation'. Search on Bibsonomy ICDT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF concurrency, transaction, serializability, monotonicity, recoverability, Snapshot Isolation
12Wen Ming Liu, Lingyu Wang 0001, Lei Zhang 0004 k-jump strategy for preserving privacy in micro-data disclosure. Search on Bibsonomy ICDT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
12Mohammed Yousef, Ahmed Hashem, Hassan Saad, Amr Gamal, Osama Galal, Khaled F. Hussain A scripting language for Digital Content Creation applications. Search on Bibsonomy SIGGRAPH Posters The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
12Paola Flocchini, Andrzej Pelc, Nicola Santoro Fault-Tolerant Sequential Scan. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Matti Järvisalo, Tommi A. Junttila Limitations of restricted branching in clause learning. Search on Bibsonomy Constraints An Int. J. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Branching heuristics, Clause learning, Backdoor sets, Proof complexity, Propositional satisfiability, DPLL, Problem structure
Displaying result #1 - #100 of 266 (100 per page; Change: )
Pages: [1][2][3][>>]
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