Register | Log in | FAQ      [?] 
Recent | Recommended | Search | Authors | Tags | Export

Group: CSBBGraphTheory - with tag complexity [40 articles]

Recent papers posted by members of the CSBBGraphTheory group with tag complexity
  • Classes of Recursively Enumerable Sets and Their Decision Problems
    Transactions of the American Mathematical Society, Vol. 74, No. 2. (1953), pp. 358-366.
    by HG Rice
    posted to logic complexity by AbnerCYH to the group CSBBGraphTheory on 2007-09-21 09:56:19 as ** along with 1 person reiju
  • Average-Case Complexity
    (10 December 2006)
    by Andrej Bogdanov, Luca Trevisan
    posted to math complexity by AbnerCYH to the group CSBBGraphTheory on 2007-09-10 15:53:09 as **
  • Parameterized Approximability of the Disjoint Cycle Problem
    Automata, Languages and Programming (2007), pp. 363-374.
    by Martin Grohe, Magdalena Grüber
    posted to graph complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-09-05 09:59:47 as **
  • Deterministic restrictions in circuit complexity
    (1996), pp. 30-36.
    by Shiva Chaudhuri, Jaikumar Radhakrishnan
    posted to math complexity algebra by AbnerCYH to the group CSBBGraphTheory on 2007-08-28 08:16:30 as **
  • Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
    STACS 2006 (2006), pp. 672-683.
    by Alexander Healy, Emanuele Viola
    posted to math complexity algebra by AbnerCYH to the group CSBBGraphTheory on 2007-08-28 08:14:10 as **
  • Nowhere zero flows in line graphs
    Discrete Mathematics, Vol. 230, No. 1-3. (6 March 2001), pp. 133-141.
    by Zhi-Hong Chen, Hong-Jian Lai, Hongyuan Lai
    posted to optimization graph complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-08-27 14:47:04 as **
  • Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
    Algorithmica, Vol. 42, No. 2. (1 April 2005), pp. 121-139.
    by Markus Bläser, Bodo Manthey
    posted to optimization graph complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-08-27 14:31:30 as **
  • Improved Algorithms and Complexity Results for Power Domination in Graphs
    : Fundamentals of Computation Theory (2005), pp. 172-184.
    by Jiong Guo, Rolf Niedermeier, Daniel Raible
    posted to graph complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-08-23 17:10:21 as ** along with 1 person bigbossman
  • The parameterized complexity of database queries
    (2001), pp. 82-92.
    by Martin Grohe
    posted to logic complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-08-23 12:13:18 as **
  • Characterizing Hardness in Parameterized Complexity
    (2007)
    by Tarique Islam
    posted to math complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-08-23 09:51:52 as **
  • Parameterized circuit complexity and the W hierarchy
    Theoretical Computer Science, Vol. 191, No. 1-2. (30 January 1998), pp. 97-115.
    by Rodney G Downey, Michael R Fellows, Kenneth W Regan
    posted to logic complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-08-23 06:25:21 as **
  • Complexity Results on Graphs with Few Cliques
    Discrete Mathematics and Theoretical Computer Science, Vol. 9, No. 1. (2007)
    by Bill Rosgen, Lorna Stewart
    posted to graph complexity by AbnerCYH to the group CSBBGraphTheory on 2007-08-23 04:33:04 as **
  • Communication Complexity
    (28 December 1996)
    by Eyal Kushilevitz, Noam Nisan
    posted to complexity by AbnerCYH to the group CSBBGraphTheory on 2007-08-12 06:37:03 as ** along with 2 people BarrosH Lara
  • Worst-case Analysis of Set Union Algorithms
    J. ACM, Vol. 31, No. 2. (April 1984), pp. 245-281.
    by Robert E Tarjan, Jan van Leeuwen
    posted to graph complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-08-09 08:51:33 as **
  • Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
    Information Processing Letters, Vol. 103, No. 2. (16 July 2007), pp. 45-51.
    by Brendan Lucier, Tao Jiang, Ming Li
    posted to information complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-08-09 08:51:07 as **
  • Parameterized power domination complexity
    Information Processing Letters, Vol. 98, No. 4. (31 May 2006), pp. 145-149.
    by Joachim Kneis, Daniel Molle, Stefan Richter, Peter Rossmanith
    posted to graph complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-08-09 08:46:58 as *****
  • Learning a Hidden Subgraph
    SIAM Journal on Discrete Mathematics, Vol. 18, No. 4. (2005), pp. 697-712.
    by Noga Alon, Vera Asodi
    posted to complexity combinatorics algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-08-04 20:04:47 as **
  • Introduction to automata theory, languages, and computation
    (1979)
    by John E Hopcroft, Jeffrey D Ullman
    posted to complexity automata by AbnerCYH to the group CSBBGraphTheory on 2007-08-03 10:10:26 as **
  • The classical decision problem
    (1997)
    by Egon Börger, Erich Grädel, Yuri Gurevich
    posted to logic complexity by AbnerCYH to the group CSBBGraphTheory on 2007-07-28 15:27:32 as **
  • Logspace Optimization Problems and Their Approximability Properties
    Theory of Computing Systems, Vol. 41, No. 2. (2007), pp. 327-350.
    by Till Tantau
    posted to complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-07-26 17:41:13 as *****
  • Average-Case Non-Approximability of Optimisation Problems
    Theory of Computing Systems, Vol. 41, No. 2. (2007), pp. 351-368.
    by Birgit Schelm
  • Combinatorial Group Testing and Its Applications (Applied Mathematics)
    (01 January 2000)
    by Ding-Zhu Du, Frank K Hwang
    posted to information complexity combinatorics algorithms algebra by AbnerCYH to the group CSBBGraphTheory on 2007-07-26 12:37:21 as **
  • Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes
    (18 May 2005)
    by David Eppstein, Michael T Goodrich, Daniel S Hirschberg
    posted to information complexity algorithms algebra by AbnerCYH to the group CSBBGraphTheory on 2007-07-26 12:36:23 as ** along with 1 person rmk
  • Monadic Second-Order Evaluations on Tree-Decomposable Graphs.
    Theor. Comput. Sci., Vol. 109, No. 1&2. (1993), pp. 49-82.
    by Bruno Courcelle, Mohamed Mosbah
    posted to logic complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-07-25 08:49:36 as **
  • Topological Automata
    Theory of Computing Systems, Vol. 40, No. 4. (18 June 2007), pp. 397-407.
    by Emmanuel Jeandel
    posted to complexity automata by AbnerCYH to the group CSBBGraphTheory on 2007-07-25 08:44:36 as **
  • Dynamic Complexity Theory Revisited
    Theory of Computing Systems, Vol. 40, No. 4. (18 June 2007), pp. 355-377.
    by Volker Weber, Thomas Schwentick
    posted to complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-07-25 08:44:13 as **
  • Analysis of Sorting Algorithms by Kolmogorov Complexity
    by Survey P Vit
    posted to math information complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-07-24 09:46:36 as ** along with 2 people scis0000001 neilc
  • Natural Proofs
    Journal of Computer and System Sciences, Vol. 55, No. 1. (August 1997), pp. 24-35.
    by Alexander A Razborov, Steven Rudich
    posted to math complexity by AbnerCYH to the group CSBBGraphTheory on 2007-07-24 09:38:01 as ** along with 1 person madhurt
  • Expressiveness and complexity of graph logic.
    Inf. Comput., Vol. 205, No. 3. (2007), pp. 263-310.
    by Anuj Dawar, Philippa Gardner, Giorgio Ghelli
    posted to math graph complexity by AbnerCYH to the group CSBBGraphTheory on 2007-07-13 01:18:58 as **
  • Comparing the power of games on graphs
    Mathematical Logic Quarterly, Vol. 43, No. 4. (1997), pp. 431-455.
    by R Fagin
    posted to graph complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-07-02 20:12:24 as ** along with 1 person Scis0000002
  • Computability and the Implicit Function Theorem
    Electronic Notes in Theoretical Computer Science, Vol. 167 (24 January 2007), pp. 3-15.
    by Timothy H Mcnicholl
    posted to math complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-03-27 12:03:53 as **
  • The Methods of Approximation and Lifting in Real Computation
    Electronic Notes in Theoretical Computer Science, Vol. 167 (24 January 2007), pp. 387-423.
    by Manuel L Campagnolo, Kerry Ojakian
    posted to math complexity algorithms by AbnerCYH to the group CSBBGraphTheory on 2007-03-27 12:03:39 as **
  • Combinatorics of branching in higher dimensional automata
    (1999)
    by P Gaucher
  • Algorithmic Information Theory: a brief non-technical guide to the field
    Scholarpedia (6 Mar 2007)
    by Marcus Hutter
  • On the Submodularity of Influence in Social Networks
    (2 Dec 2006)
    by Elchanan Mossel, Sebastien Roch
    posted to algorithms complexity dynamics graph by AbnerCYH to the group CSBBGraphTheory on 2006-12-05 11:30:21 as ** along with 1 person ansobol
  • The structure and function of complex networks
    (25 March 2003)
    by MEJ Newman
  • Graph building as a mining activity: finding links in the small
    (2005), pp. 17-24.
    by Antonio Badia, Mehmed Kantardzic
  • Random matrix analysis of network Laplacians
    (29 Nov 2006)
    by Sarika Jalan, Jayendra N Bandyopadhyay
    posted to complexity dynamics graph by AbnerCYH to the group CSBBGraphTheory on 2006-12-01 04:05:20 as ** along with 4 people trunov ansobol RMT gane5h
  • Computable Analysis : An Introduction (Texts in Theoretical Computer Science. An EATCS Series)
    (27 November 2000)
    by Klaus Weihrauch
    posted to complexity math by AbnerCYH to the group CSBBGraphTheory on 2006-06-20 17:25:53 as **
  • Complexity and Real Computation
    (30 October 1997)
    by Lenore Blum, Felipe Cucker, Michael Shub, Steve Smale
    posted to complexity math by AbnerCYH to the group CSBBGraphTheory on 2006-06-20 17:25:47 as ** along with 1 person BarrosH
  • Note: You may cite this page as: http://www.citeulike.org/group/2902/tag/complexity

    RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.