The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1977-1989 (18) 1990-1992 (20) 1993-1995 (22) 1996-1998 (15) 1999-2001 (21) 2002-2005 (22) 2006-2007 (26) 2008 (17) 2009-2010 (21) 2011-2013 (17) 2014-2015 (16) 2016-2017 (17) 2018-2021 (16) 2022-2024 (11)
Publication types (Num. hits)
article(109) inproceedings(150)
Venues (Conferences, Journals, ...)
CoRR(30) STACS(19) Electron. Colloquium Comput. C...(18) CCC(16) MFCS(15) LICS(9) STOC(8) Comput. Complex.(7) Theory Comput. Syst.(6) FOCS(5) FSTTCS(5) SCT(5) Theor. Comput. Sci.(5) CiE(4) CSL(4) Inf. Comput.(4) More (+10 of total 87)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 78 occurrences of 59 keywords

Results
Found 259 publication records. Showing 259 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
133Till Tantau Logspace Optimization Problems and Their Approximability Properties. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
119Till Tantau Logspace Optimization Problems and Their Approximability Properties. Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
95Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty 0001, Samir Datta, Sambuddha Roy Planar and Grid Graph Reachability Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Logspace, Algorithms, Planar graphs, Reachability, Complexity theory, Circuit complexity, Grid graphs
91Satyanarayana V. Lokam, Meena Mahajan, V. Vinay Logspace Verifiers, NC, and NP. Search on Bibsonomy ISAAC The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
88Johannes Köbler, Sebastian Kuhnert The Isomorphism Problem for k-Trees Is Complete for Logspace. Search on Bibsonomy MFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF graph canonization, logspace completeness, graph isomorphism, space complexity, k-trees
84Hans-Jörg Burtschick Comparing Counting Classes for Logspace, One-way Logspace, and First-order. Search on Bibsonomy MFCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
77Douglas Cenzer, Zia Uddin Logspace Complexity of Functions and Structures. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Complexity, Computability, Computable Model Theory
77Vikraman Arvind, T. C. Vijayaraghavan Abelian Permutation Group Problems and Logspace Counting Classes. Search on Bibsonomy CCC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
77Erich 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
63Vikraman Arvind, Bireswar Das, Johannes Köbler A Logspace Algorithm for Partial 2-Tree Canonization. Search on Bibsonomy CSR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
60Andreas Jakoby, Till Tantau Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs
56Vikraman Arvind, Bireswar Das, Johannes Köbler The Space Complexity of k -Tree Isomorphism. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
56Kai-Min Chung, Omer Reingold, Salil P. Vadhan S-T Connectivity on Digraphs with a Known Stationary Distribution. Search on Bibsonomy CCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
53Georg Gottlob Collapsing Oracle-Tape Hierarchies. Search on Bibsonomy CCC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF tape, logspace, logarithmic space, machine model, complexity, query, oracle, circuit, Turing machine, generalized quantifier, relativization, bounded queries
49Guillaume Bonfante Some Programming Languages for Logspace and Ptime. Search on Bibsonomy AMAST The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
49Alexander Leontjev, Vladimir Yu. Sazonov Capturing LOGSPACE over Hereditarily-Finite Sets. Search on Bibsonomy FoIKS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
49Birgit Jenner Closure under Complementation of Logspace Complexity Classes - A Survey. Search on Bibsonomy Foundations of Computer Science: Potential - Theory - Cognition The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
49Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel Structure and Importance of Logspace-MOD-Classes. Search on Bibsonomy STACS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
42Martin Hofmann 0001, Ulrich Schöpp Pointer Programs and Undirected Reachability. Search on Bibsonomy LICS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
42Alina Beygelzimer, Mitsunori Ogihara The (Non)Enumerability of the Determinant and the Rank. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
42Thanh Minh Hoang, Thomas Thierauf The Complexity of Verifying the Characteristic Polynomial and Testing Similarity. Search on Bibsonomy CCC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
42Matthias Ruhl Counting and Addition Cannot Express Deterministic Transitive Closure. Search on Bibsonomy LICS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Counting quantifiers, circuit complexity, finite model theory, descriptive complexity theory
42John Watrous Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity. Search on Bibsonomy CCC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF quantum computation, graph connectivity, space-bounded computation
42Jin-yi Cai, Ashish V. Naik, D. Sivakumar On the Existence of Hard Sparse Sets under Weak Reductions. Search on Bibsonomy STACS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
42Sairam Sairam, Jeffrey Scott Vitter, Roberto Tamassia A Complexity Theoretic Approach to Incremental Computation. Search on Bibsonomy STACS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
42Richard J. Lipton Efficient Checking of Computations. Search on Bibsonomy STACS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
39Jin-yi Cai, Hong Zhu 0004 Progress in Computational Complexity Theory. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF computational complexity theory, PCP theorem, logspace complexity, Reingold's theorem, GAP problem, complexity of lattice problems, worst-case to average-case reductions, extractors, pseudorandomness, inapproximability, primality testing, theoretical computer science, holographic algorithms
35Till Tantau A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. Search on Bibsonomy STACS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
35Grégory Lafitte, Jacques Mazoyer The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory. Search on Bibsonomy MFCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
35Uriel Feige A Fast Randomized LOGSPACE Algorithm for Graph Connectivity. Search on Bibsonomy ICALP The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
35Iain A. Stewart Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs. Search on Bibsonomy WG The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
35Klaus-Jörn Lange Nondeterministic Logspace Reductions. Search on Bibsonomy MFCS The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
28Venkatesan Guruswami, Valentine Kabanets Hardness Amplification via Space-Efficient Direct Products. Search on Bibsonomy Comput. Complex. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF 94B35, 68Q25, 94B05, 68P30, Subject classification. 68Q17
28Martin Hofmann 0001, Ulrich Schöpp Pure Pointer Programs with Iteration. Search on Bibsonomy CSL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Venkatesan Guruswami, Valentine Kabanets Hardness Amplification Via Space-Efficient Direct Products. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF error-correcting codes, expanders, Direct products, hardness amplification
28Georg Gottlob, Christoph Koch 0001, Reinhard Pichler, Luc Segoufin The complexity of XPath query evaluation and XML typing. Search on Bibsonomy J. ACM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF LOGCFL, XML, Complexity, XPath, DTD
28Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. Search on Bibsonomy CCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Thanh Minh Hoang, Thomas Thierauf On the Minimal Polynomial of a Matrix. Search on Bibsonomy COCOON The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
28Manindra Agrawal Towards Uniform AC0 - Isomorphisms. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
28Kai Salomaa, Derick Wood, Sheng Yu 0001 Complexity of E0L Structural Equivalence. Search on Bibsonomy MFCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
28Iain A. Stewart Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines. Search on Bibsonomy CSL The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
28Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes Using Inductive Counting to Simulate Nondeterministic Computation. Search on Bibsonomy MFCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
28Helmut Seidl Deciding Equivalence of Finite Tree Automata. Search on Bibsonomy STACS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
25Derrick Stolee, Chris Bourke, N. V. Vinodchandran A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. Search on Bibsonomy CCC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF acyclic digraph, logspace algorithm, planar graph, reachability
25Lance Fortnow, Judy Goldsmith, Stephen R. Mahaney L-Printable Sets. Search on Bibsonomy CCC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF printability, logspace, rankability, computational complexity
25Jin-yi Cai, D. Sivakumar The Resolution of a Hartmanis Conjecture. Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Hartmanis conjecture, sparse sets, logspace many-one reductions, sparse hard set, computational complexity
25Mitsunori Ogihara Sparse P-Hard Sets Yield Space-Efficient Algorithms. Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF sparse P-hard sets, space-efficient algorithms, logspace many-one reductions, poly-logarithmic space-computable many-one reductions, computational complexity
25Ker-I Ko Computational Complexity of Roots of Real Functions (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF roots of real functions, one-to-one, k-to-one functions, discrete complexity classes, LOGSPACE, P, UP, classification, computational complexity, NP
21Uma Girish, Ran Raz, Wei Zhan Quantum Logspace Computations are Verifiable. Search on Bibsonomy SOSA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
21Anselm Haak, Arne Meier, Om Prakash 0002, B. V. Raghavendra Rao Parameterised Counting in Logspace. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Uma Girish, Ran Raz, Wei Zhan Quantum Logspace Computations are Verifiable. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
21Yakov Shalunov Leakage-Resilient Hardness Equivalence to Logspace Derandomization. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus Simulating Logspace-Recursion with Logarithmic Quantifier Depth. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Uma Girish, Ran Raz, Wei Zhan Quantum Logspace Computations are Verifiable. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus Simulating Logspace-Recursion with Logarithmic Quantifier Depth. Search on Bibsonomy LICS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Reiner Czerwinski Incomplete sets in P for logspace-reduction. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  BibTeX  RDF
21Pratish Datta, Tapas Pal, Katsuyuki Takashima Compact FE for Unbounded Attribute-Weighted Sums for Logspace from SXDH. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2022 DBLP  BibTeX  RDF
21William M. Hoza, Chris Umans Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Pratish Datta, Tapas Pal, Katsuyuki Takashima Compact FE for Unbounded Attribute-Weighted Sums for Logspace from SXDH. Search on Bibsonomy ASIACRYPT (1) The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros #NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes. Search on Bibsonomy J. ACM The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Cody Karcher Logspace Sequential Quadratic Programming for Design Optimization. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
21Jay Mardia Logspace Reducibility From Secret Leakage Planted Clique. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
21Uma Girish, Ran Raz, Wei Zhan Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. Search on Bibsonomy ICALP The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Anselm Haak, Arne Meier, Om Prakash 0002, B. V. Raghavendra Rao Parameterised Counting in Logspace. Search on Bibsonomy STACS The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Reinhard Pichler Technical Perspective: Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation. Search on Bibsonomy SIGMOD Rec. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation. Search on Bibsonomy SIGMOD Rec. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Uma Girish, Ran Raz, Wei Zhan Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2020 DBLP  BibTeX  RDF
21Neil D. Jones, Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen Cons-free Programs and Complexity Classes between LOGSPACE and PTIME. Search on Bibsonomy VPT/HCVS@ETAPS The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Uma Girish, Ran Raz, Wei Zhan Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
21Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
21Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation. Search on Bibsonomy PODS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Chetan Gupta 0002, Vimal Raj Sharma, Raghunath Tewari Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Paraschos Koutris, Jef Wijsen Consistent Query Answering for Primary Keys in Logspace. Search on Bibsonomy ICDT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Paraschos Koutris, Jef Wijsen Consistent Query Answering for Primary Keys in Logspace. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
21Lukasz Czajka 0001 Term Rewriting Characterisation of LOGSPACE for Finite and Infinite Data. Search on Bibsonomy FSCD The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
21Dean Doron, Amir Sarid, Amnon Ta-Shma On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace. Search on Bibsonomy Comput. Complex. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Marc Bagnol Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
21Marc Bagnol Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees. Search on Bibsonomy Log. Methods Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Michael Elberfeld, Pascal Schweitzer Canonizing Graphs of Bounded Tree Width in Logspace. Search on Bibsonomy ACM Trans. Comput. Theory The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Christian Glaßer, Maximilian Witek Autoreducibility and mitoticity of logspace-complete sets for NP and other classes. Search on Bibsonomy Inf. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21William M. Hoza, Chris Umans Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace. Search on Bibsonomy STOC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Dean Doron, Amir Sarid, Amnon Ta-Shma On approximating the eigenvalues of stochastic matrices in probabilistic logspace. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2016 DBLP  BibTeX  RDF
21Boris Brimkov, Illya V. Hicks On the logspace shortest path problem. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2016 DBLP  BibTeX  RDF
21Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky 0001 Solving the canonical representation and Star System Problems for proper circular-arc graphs in logspace. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Armin Weiß A Logspace Solution to the Word and Conjugacy problem of Generalized Baumslag-Solitar Groups. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
21William M. Hoza, Chris Umans Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
21Benjamin A. Burton, Murray Elder, Arkadius G. Kalka, Stephan Tillmann 2-manifold recognition is in logspace. Search on Bibsonomy J. Comput. Geom. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Volker Diekert, Jonathan Kausch Logspace computations in graph products. Search on Bibsonomy J. Symb. Comput. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Peter Dixon 0002, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran A Note on the Advice Complexity of Multipass Randomized Logspace. Search on Bibsonomy MFCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Armin Weiß A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups. Search on Bibsonomy AMS-EMS-SPM Joint Meeting The full citation details ... 2016 DBLP  BibTeX  RDF
21Michael Elberfeld, Pascal Schweitzer Canonizing Graphs of Bounded Tree Width in Logspace. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Maurice Chandoo Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Boris Brimkov A reduction of the logspace shortest path problem to biconnected graphs. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
21Michael Elberfeld, Pascal Schweitzer Canonizing Graphs of Bounded Tree Width in Logspace. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
21Maurice Chandoo Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
21Jeremy MacDonald, Alexei G. Myasnikov, Andrey Nikolaev, Svetla Vassileva Logspace and compressed-word computations in nilpotent groups. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
21Marc Bagnol MALL proof equivalence is Logspace-complete, via binary decision diagrams. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
21Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. Search on Bibsonomy WALCOM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
21Marc Bagnol MALL Proof Equivalence is Logspace-Complete, via Binary Decision Diagrams. Search on Bibsonomy TLCA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
21Víctor Dalmau, László Egri, Pavol Hell, Benoît Larose, Arash Rafiey Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. Search on Bibsonomy LICS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 259 (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