The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1951-1973 (15) 1974-1977 (17) 1978-1984 (17) 1985-1987 (17) 1988-1989 (18) 1990 (16) 1991 (16) 1992-1993 (25) 1994 (19) 1995-1996 (26) 1997 (15) 1998 (17) 1999 (15) 2000-2001 (33) 2002-2003 (22) 2004 (24) 2005 (21) 2006 (24) 2007 (22) 2008 (21) 2009 (24) 2010 (15) 2011-2012 (33) 2013-2014 (20) 2015-2016 (26) 2017-2018 (16) 2019-2020 (28) 2021-2022 (19) 2023-2024 (13)
Publication types (Num. hits)
article(317) incollection(5) inproceedings(268) phdthesis(4)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 255 occurrences of 188 keywords

Results
Found 594 publication records. Showing 594 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
174Yevgeniy Dodis, Silvio Micali Parallel Reducibility for Information-Theoretically Secure Computation. Search on Bibsonomy CRYPTO The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
90Xizhong Zheng, Robert Rettinger On the Extensions of Solovay-Reducibility.. Search on Bibsonomy COCOON The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
84Roland Sh. Omanadze, Andrea Sorbi Strong Enumeration Reducibilities. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 03D30
73Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik On Coherence, Random-self-reducibility, and Self-correction. Search on Bibsonomy CCC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF self-correctability, random-self-reducibility, polynomial advice, adaptive versus nonadaptive oracle machines, Computational complexity, coherence, Kolmogorov complexity
66Robert Rettinger, Xizhong Zheng Solovay Reducibility on D-c.e Real Numbers. Search on Bibsonomy COCOON The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
66Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte Randomness and Reducibility. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
66Christoph Meinel, Anna Slobodová A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams. Search on Bibsonomy STACS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
66Emmanuel Kounalis Testing for Inductive (Co)-Reducibility. Search on Bibsonomy CAAP The full citation details ... 1990 DBLP  DOI  BibTeX  RDF Proof by consistency, Ground terms in normal form, Term rewriting systems, Test Sets, Equations
61Eric Allender, Michal Koucký 0001 Amplifying Lower Bounds by Means of Self-Reducibility. Search on Bibsonomy CCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF self-reducibility, lower bounds, circuit complexity
60Wolfgang Merkle, Frank Stephan 0001 On C-Degrees, H-Degrees and T-Degrees. Search on Bibsonomy CCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
60Steven Homer Minimal degrees for polynomial reducibilities. Search on Bibsonomy J. ACM The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
54Randy Goebel Folk Reducibility and AI-Complete Problems. Search on Bibsonomy KI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
54Charles M. Harris Enumeration Reducibility with Polynomial Time Bounds. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
54Sam Lindley, Ian Stark Reducibility and TT-Lifting for Computation Types. Search on Bibsonomy TLCA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
54Charles M. Harris Symmetric Enumeration Reducibility. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
54Joan Feigenbaum, Martin Strauss 0001 An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract). Search on Bibsonomy STACS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
49Victor L. Selivanov Wadge Reducibility and Infinite Computations. Search on Bibsonomy Math. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Wadge reducibility, Baire space, Baire domain, ?-language, k-partition, complexity, topology, computability, automaton
49Mark Burgin Universality, Reducibility, and Completeness. Search on Bibsonomy MCU The full citation details ... 2007 DBLP  DOI  BibTeX  RDF problem completeness, algorithm, computability, reducibility, universal, computing power, problem hardness
49Dieter Spreen Strong reducibility of partial numberings. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Partial numberings, Total numberings, Complete numberings, Degree structure, Reducibility
48Andrea Sorbi Strong Positive Reducibilities. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
48Christian Glaßer, Stephen D. Travers, Klaus W. Wagner Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. Search on Bibsonomy Developments in Language Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
48Kouichi Sakurai, Hiroki Shizuya Relationships Among the Computational Powers of Breaking Discrete Log Cryptosystems. Search on Bibsonomy EUROCRYPT The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
44David Jao, Stephen D. Miller, Ramarathnam Venkatesan Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? Search on Bibsonomy ASIACRYPT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF random reducibility, modular forms, L-functions, generalized Riemann hypothesis, elliptic curves, expanders, Ramanujan graphs, isogenies, rapid mixing, discrete log
44André Große, Jörg Rothe, Gerd Wechsung Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions. Search on Bibsonomy ICTCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF complexity of smallest solutions, self-reducibility, graph colorability, Hamiltonian cycles, graph isomorphisms, partial solutions
42Colin Riba Union of Reducibility Candidates for Orthogonal Constructor Rewriting. Search on Bibsonomy CiE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
42Sergey M. Dudakov Isolation and Reducibility Properties and the Collapse Result. Search on Bibsonomy CSR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
42Domenico Lembo, Riccardo Rosati 0001, Marco Ruzzi On the First-Order Reducibility of Unions of Conjunctive Queries over Inconsistent Databases. Search on Bibsonomy EDBT Workshops The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
42Victor L. Selivanov, Klaus W. Wagner A Reducibility for the Dot-Depth Hierarchy. Search on Bibsonomy MFCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
42Kouichi Hirata, Hiroshi Sakamoto Prediction-Preserving Reducibility with Membership Queries on Formal Languages. Search on Bibsonomy FCT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF prediction-preserving reduction with membership queries, prediction with membership queries, pattern languages, learning theory, context-free grammars, grammatical inference
42Heribert Vollmer On Different Reducibility Notions for Function Classes. Search on Bibsonomy STACS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
37Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky Reducibility and Completeness in Multi-Party Private Computations Search on Bibsonomy FOCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF Oblivious Transfer protocol, multi-party private computations, n-privacy, Boolean functions, completeness, reducibility, black-box, multi-party protocols
37Stavros S. Cosmadakis Logical Reducibility and Monadic NP Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF syntactically restricted first-order reductions, logical reducibility, monadic NP, polynomial-time many-one reductions, directed reachability, encodings, first-order logic, NP-complete problems, relational structures
36Sanjay Jain 0001, Frank Stephan 0001 Mitotic Classes. Search on Bibsonomy COLT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
36Isabelle Gnaedig, Hélène Kirchner Computing constructor forms with non terminating rewrite programs. Search on Bibsonomy PPDP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF constructor, abstraction, termination, narrowing, ordering constraint, sufficient completeness
36Klaus Ambos-Spies Problems with Cannot Be Reduced to Any Proper Subproblems. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Dieter Hofbauer, Maria Huber Test Sets for the Universal and Existential Closure of Regular Tree Languages. Search on Bibsonomy RTA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
36Vikraman Arvind, Johannes Köbler, Martin Mundhenk Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. Search on Bibsonomy MFCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
36Reinhard Bündgen, Wolfgang Küchlin Computing Ground Reducability and Inductively Complete Positions. Search on Bibsonomy RTA The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
35Yannick Forster 0002, Felix Jahn Constructive and Synthetic Reducibility Degrees: Post's Problem for Many-One and Truth-Table Reducibility in Coq. Search on Bibsonomy CSL The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
35Yuefei Sui A New Reducibility between Turing- and wtt-Reducibility. Search on Bibsonomy Math. Log. Q. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
35Timothy J. Long On gamma-Reducibility Versus Polynomial Time Many-One Reducibility. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
35Timothy J. Long On gamma-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract) Search on Bibsonomy STOC The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
35Herbert Fleischner On the Equivalence of Mealy-Type and Moore-Type Automata and a Relation between Reducibility and Moore-Reducibility. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1977 DBLP  DOI  BibTeX  RDF
32Roberto M. Amadio On Stratified Regions. Search on Bibsonomy APLAS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Types and effects, Reducibility candidates, Termination
32Malgorzata Biernacka, Dariusz Biernacki Context-based proofs of termination for typed delimited-control operators. Search on Bibsonomy PPDP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF reducibility predicates, type system, continuation-passing style, delimited continuations, reduction semantics
32Victor L. Selivanov Fine Hierarchy of Regular Aperiodic omega -Languages. Search on Bibsonomy Developments in Language Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF acceptor, regular aperiodic ?-language, Wagner hierarchy, reducibility, Automaton, transducer
32Gianna M. Del Corso, Antonio Gulli, Francesco Romani Fast PageRank Computation Via a Sparse Linear System (Extended Abstract). Search on Bibsonomy WAW The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Web Matrix Reducibility and Permutation, Search Engines, Link Analysis
32Victor L. Selivanov Wadge Degrees of omega-Languages of Deterministic Turing Machines. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Wadge degree, $omega$-language, Cantor space, set-theoretic operation, hierarchy, reducibility
32Paliath Narendran, Michaël Rusinowitch The Theory of Total Unary RPO Is Decidable. Search on Bibsonomy Computational Logic The full citation details ... 2000 DBLP  DOI  BibTeX  RDF recursive path ordering, ground reducibility, ordered rewriting, tree automata, first-order theory
32Helena Handschuh, Yiannis Tsiounis, Moti Yung Decision Oracles are Equivalent to Matching Oracles. Search on Bibsonomy Public Key Cryptography The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Diffie-Hellman variants, randomized reductions, uniform reductions, homomorphic encryption functions (ElGamal, Goldwasser-Micali, Okamoto-Uchiyama, Naccache-Stern), random self-reducibility, universal malleability, public-key encryption, decision problems, matching problems
32Adel Bouhoula, Jean-Pierre Jouannaud Automata-Driven Automated Induction. Search on Bibsonomy LICS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF automata-driven automated induction, inductive theorem proving, first-order functions, finitely many unary membership predicates, rational subsets, ground reducibility, inductive prover, theorem proving, tree automata, Horn Clauses, proof obligations
32Rodney G. Downey, André Nies Undecidability Results for Low Complexity Degree Structures. Search on Bibsonomy CCC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF undecidability results, low complexity degree structures, EXPTIME degrees, polynomial time Turing, many-one reducibility, coding method, ideal lattices, hyper-polynomial time classes, Boolean algebra, Boolean algebras
30Colin Riba On the Values of Reducibility Candidates. Search on Bibsonomy TLCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
30Colin Riba On the Stability by Union of Reducibility Candidates. Search on Bibsonomy FoSSaCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Kai-Sheng Lu, Xiao-Yu Feng, Guo-Zhang Gao The separability, reducibility and controllability of RLCM networks over F(z). Search on Bibsonomy ISCAS (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
30Tsuyoshi Iwagaki, Satoshi Ohtake, Hideo Fujiwara Reducibility of Sequential Test Generation to Combinational Test Generation for Several Delay Fault Models. Search on Bibsonomy Asian Test Symposium The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
30Pavel Pudlák On Reducibility and Symmetry of Disjoint NP-Pairs. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
30Erich Grädel, Marc Spielmann Logspace Reducibility via Abstract State Machines. Search on Bibsonomy World Congress on Formal Methods The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
30László Babai, Sophie Laplante Stronger Separations for Random-Self-Reducibility, Rounds, and Advice. Search on Bibsonomy CCC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
30Hubert Comon, Florent Jacquemard Ground Reducibility is EXPTIME-Complete. Search on Bibsonomy LICS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
30Michael F. Singer Testing reducibility of linear differential operators: A group theoretic perspective. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Linear differential operator, Berlekamp algorithm, Differential Galois theory, Factorization
30Hubert Comon, Florent Jacquemard Ground Reducibility and Automata with Disequality Constraints. Search on Bibsonomy STACS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
30Karol Habart Randomness and Turing Reducibility Restraints. Search on Bibsonomy CSL The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
24Shuji Isobe, Eisuke Koizumi, Yuji Nishigaki, Hiroki Shizuya On the Complexity of Computing Discrete Logarithms over Algebraic Tori. Search on Bibsonomy CANS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF algebraic tori, order certified discrete logarithms, Turing reduction
24Russell Impagliazzo, Nathan Segerlind Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Modular counting axioms, Nullstellensatz refutations, propositional proof complexity
24Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang Redundancy in Complete Sets. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
24George Barmpalias Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
24Marcus Schaefer 0001, Frank Stephan 0001 Strong Reductions and Immunity for Exponential Time. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF hardness for exponential time, polynomial time reducibilities, Computational and structural complexity
24Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe 0001 The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
24Peter A. Fejer, Richard A. Shore Every incomplete computably enumerable truth-table degree is branching. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 03D30, 03D25
24Rodney G. Downey, Denis R. Hirschfeldt, André Nies Randomness, Computability, and Density. Search on Bibsonomy STACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
24Massimiliano Goldwurm, Beatrice Palano, Massimo Santini 0001 On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages. Search on Bibsonomy STACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Uniform random generation, ambiguous context-free languages, auxiliary pushdown automata, circuit complexity
24Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe 0001 On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. Search on Bibsonomy STACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
24Jens Lechtenbörger, Gottfried Vossen On Herbrand Semantics and Conflict Serializability of Read-Write Transactions. Search on Bibsonomy PODS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
24Jochen Meßner On Optimal Algorithms and Optimal Proof Systems. Search on Bibsonomy STACS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
24Kouichi Sakurai, Hiroki Shizuya A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems. Search on Bibsonomy J. Cryptol. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Computational number theory, Computational number theory, Securi, Security, Randomness, Randomness, Public-key cryptography, Public-key cryptography, Elliptic curves, Elliptic curves, Key exchange, Key exchange, Discrete logarithm, Discrete logarithm, Key words, Cryptosystem, Cryptosystem
24Klaus Ambos-Spies, Elvira Mayordomo, Xizhong Zheng A Comparison of Weak Completeness Notions. Search on Bibsonomy CCC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Weak Completeness, Measure, Genericity, Completeness
24Rachid Guerraoui Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus. Search on Bibsonomy WDAG The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
24Martin Mundhenk On Self-Reducible Sets of Low Information Content. Search on Bibsonomy CIAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
24Mitsunori Ogiwara NC^k(NP) = AC^(k-1)(NP). Search on Bibsonomy STACS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
24Pierluigi Crescenzi, Luca Trevisan On Approximation Scheme Preserving Reducability and Its Applications. Search on Bibsonomy FSTTCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
24Jean H. Gallier Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves (Abstract). Search on Bibsonomy RTA The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
24Osamu Watanabe 0001, Seinosuke Toda Structural Analyses on the Complexity of Inverting Functions. Search on Bibsonomy SIGAL International Symposium on Algorithms The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
24Donald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway Security with Low Communication Overhead. Search on Bibsonomy CRYPTO The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
24Lyle Ramshaw Eliminating go to's while preserving program structure. Search on Bibsonomy J. ACM The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
24Klaus Ambos-Spies On the Relative Complexity of Subproblems of Intractable Problems. Search on Bibsonomy STACS The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
24Johann A. Makowsky Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory. (Errata: ICALP 1981: 551) Search on Bibsonomy ICALP The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
20Thomas Ehrhard A Finiteness Structure on Resource Terms. Search on Bibsonomy LICS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF finiteness spaces, algebraic system F, linear logic, lambda-calculus, reducibility, denotational semantics
20Harry Buhrman, Lance Fortnow, Michal Koucký 0001, Bruno Loff Derandomizing from Random Strings. Search on Bibsonomy CCC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Truth-table Reducibility, Kolmogorov Complexity, Derandomization
20Sanatan Rai, George L. Vairaktarakis NP-complete Problems and Proof Methodology. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Polynomial time reduction, strong NP-completeness, ordinary NP-completeness, Computational complexity, Reducibility, NP-complete problem, NP-hard problem
20Hamilton Emmons, Sanatan Rai Computational Complexity Theory. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Recognition problem, Time complexity function, Nondeterministic polynomial algorithm, Computational complexity, Combinatorial optimization, Reducibility, NP-complete problem, Efficient algorithm, Complexity theory, NP-hard problem, Polynomial algorithm, Decision problem, Exponential algorithm
20Chun-Yuan Chiu, Yu-Liang Kuo, Eric Hsiao-Kuang Wu, Gen-Huey Chen Bandwidth-Constrained Routing Problem in Wireless Ad Hoc Networks. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF reducibility and completeness, routing protocols, Algorithm/protocol design and analysis, mobile communication systems
20Victor L. Selivanov, Klaus W. Wagner Complexity of Aperiodicity for Topological Properties of Regular omega-Languages. Search on Bibsonomy CiE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Regular aperiodic ?-language, Wadge reducibility, aperiodic automaton, deterministic Muller automaton, nondeterministic Büchi automaton, monadic second-order formula
20Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh 0001 A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF random self-reducibility, zero-knowledge, commitment-schemes
20Takayuki Nagoya, Seinosuke Toda Relating Complete and Partial Solution for Problems Similar to Graph Automorphism. Search on Bibsonomy MFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF graph auto- morphism, Computational complexity, reducibility, partial solution
20Victor L. Selivanov A Useful Undecidable Theory. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF discrete weak semilattice, partition, theory, reducibility, undecidability, Semilattice
20V. Baleva The jump operation for structure degrees. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Structure degrees, Enumeration degrees, Degrees of structures, Reducibility, Degree, Jump
20Riccardo Camerlo Universality of Embeddability Relations for Coloured Total Orders. Search on Bibsonomy Order The full citation details ... 2005 DBLP  DOI  BibTeX  RDF coloured total order, Borel reducibility, ?1 1-universality, dendrite
20Jacob van der Woude A Characterization of the Eigenvalue of a General (Min, Max, +)-System. Search on Bibsonomy Discret. Event Dyn. Syst. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF (min,max,+)-systems, convergence of iterations, eigenvalue, reducibility
20Hideo Fujiwara A New Class of Sequential Circuits with Combinational Test Generation Complexity. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2000 DBLP  DOI  BibTeX  RDF complexity, test generation, design for testability, sequential circuits, reducibility, partial scan, Balanced structure
Displaying result #1 - #100 of 594 (100 per page; Change: )
Pages: [1][2][3][4][5][6][>>]
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