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

eporreca's library [69 articles]

Recent papers added to eporreca's library.
  • The computational complexity of knot and link problems
    J. ACM, Vol. 46, No. 2. (March 1999), pp. 185-211.
    by Joel Hass, Jeffrey C Lagarias, Nicholas Pippenger
    posted to topology theory knot complexity by eporreca on 2008-08-05 08:41:35 as **
  • A Machine-Independent Theory of the Complexity of Recursive Functions
    J. ACM, Vol. 14, No. 2. (April 1967), pp. 322-336.
    by Manuel Blum
    posted to theory theorem gap complexity by eporreca on 2008-07-29 15:46:02 as **
  • Reducibility Among Combinatorial Problems
    (1972), pp. 85-103.
    by RM Karp
    edited by RE Miller, JW Thatcher
    posted to theory reductions np-complete complexity by eporreca on 2008-07-01 12:53:29 as ** along with 1 person NinaG
  • Introduction to Membrane Computing
    Applications of Membrane Computing (2006), pp. 1-42.
    by Gheorghe Păun
    posted to tutorial p-systems mythesis by eporreca on 2008-06-19 13:06:24 as **
  • Membrane Computing
    (17 September 2002)
    by Gheorghe Paun
    posted to p-systems mythesis book by eporreca on 2008-06-19 13:00:02 as **
  • Computing with Membranes
    (1998)
    by Gheorghe Paun
    posted to p-systems mythesis by eporreca on 2008-06-10 10:15:35 as **
  • Computing with Membranes
    Journal of Computer and System Sciences, Vol. 61, No. 1. (August 2000), pp. 108-143.
    by Gheorghe Paun
    posted to tutorial p-systems mythesis by eporreca on 2008-06-09 08:37:30 as ** along with 2 people and 4 groups balicea neveaire Biostatistics Computational-Genomics Bioinformatics Neuroscience
  • Introduction to Algorithms, Second Edition
    (01 September 2001)
    by Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein
    posted to mythesis algorithms by eporreca on 2008-06-08 21:43:38 as ** along with 11 people sven_luzar pawelt jcheng dragonrez marciolima gurkanbebek tmarscha dodger042 napvasconcelos chandlerc csacca
  • Word problems requiring exponential time(Preliminary Report)
    (1973), pp. 1-9.
    by LJ Stockmeyer, AR Meyer
    posted to time theory regular expressions exponential complexity by eporreca on 2008-06-08 13:58:51 as **
  • Computing with Membranes: Attacking NP-Complete Problems
    (2001), pp. 94-115.
    by Gheorghe Paun
    posted to p-systems np-complete mythesis membranes active by eporreca on 2008-06-08 11:38:03 as **
  • Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes
    Fundam. Inf., Vol. 58, No. 2. (April 2003), pp. 67-77.
    by Artiom Alhazov, Carlos Mart∈-Vide, Linqiang Pan
    posted to theory qbf p-systems pspace mythesis complexity by eporreca on 2008-05-22 13:13:06 as **
  • The complexity of membership problems for circuits over sets of integers
    Theoretical Computer Science, Vol. 369, No. 1-3. (15 December 2006), pp. 211-229.
    by Stephen Travers
    posted to theory mythesis integers complexity circuits by eporreca on 2008-05-14 13:38:07 as **
  • The complexity of theorem-proving procedures
    (1971), pp. 151-158.
    by Stephen A Cook
    posted to theory sat np-complete mythesis complexity by eporreca on 2008-05-13 15:47:42 as ** along with 6 people JakubSzymanik stavros sdvillal bsilverthorn voronov dfabbri
  • Introduction to Automata Theory, Languages, and Computation (2nd Edition)
    (14 November 2000)
    by John E Hopcroft, Rajeev Motwani, Jeffrey D Ullman
    posted to regular mythesis languages context-free computability complexity automata by eporreca on 2008-05-13 09:15:27 as ** along with 4 people JakubSzymanik marciolima leidner whshen
  • The computational power of cell division in P systems: Beating down parallel computers?
    Natural Computing, Vol. 2, No. 3. (2003), pp. 287-298.
    by Petr Sosík
    posted to theory qbf p-systems pspace mythesis complexity by eporreca on 2008-05-07 14:11:08 as **
  • The Complexity of Games on Highly Regular Graphs
    Algorithms – ESA 2005 (2005), pp. 71-82.
    by Konstantinos Daskalakis, Christos H Papadimitriou
    posted to theory nexp-complete nash mythesis graphs games equilibrium complexity by eporreca on 2008-04-30 09:28:28 as **
  • Solving NP-Complete Problems Using P Systems with Active Membranes
    pp. 289-301.
    by Claudio Zandron, Claudio Ferretti, Giancarlo Mauri
    posted to active complexity membranes mythesis np-complete p-systems theory by eporreca on 2008-04-21 08:44:16 as **
  • Self-witnessing polynomial-time complexity and prime factorization
    Structure in Complexity Theory Conference, 1992., Proceedings of the Seventh Annual (1992), pp. 107-110.
    by MR Fellows, N Koblitz
    posted to algorithm complexity existence nonconstructive polynomial proof theory time by eporreca on 2008-04-10 20:54:24 as **
  • The Complexity of Satisfiability Problems over Finite Lattices
    STACS 2004 (2004), pp. 31-43.
    by Bernhard Schwarz
    posted to complexity finite lattices mythesis satisfiability theory by eporreca on 2008-04-07 14:24:24 as **
  • The Boolean formula value problem is in ALOGTIME
    (1987), pp. 123-131.
    by SR Buss
    posted to alogtime boolean complexity formula mythesis problem theory value by eporreca on 2008-04-07 14:00:19 as **
  • Representing Graphs by Knuth Trees
    J. ACM, Vol. 22, No. 3. (July 1975), pp. 361-366.
    by John L Pfaltz
    posted to graphs knuth mythesis representation trees by eporreca on 2008-03-20 10:08:29 as **
  • Computational Capacity of the Universe
    Physical Review Letters, Vol. 88, No. 23. (24 May 2002), 237901.
    by Seth Lloyd
    posted to capacity computation limits universe by eporreca on 2008-03-19 11:03:45 as **
  • Introduction to the Theory of Computation
    (13 December 1996)
    by Michael Sipser
    posted to book complexity computation mythesis theory by eporreca on 2008-03-19 08:54:37 as ** along with 3 people and 1 group ajylha masteraka spinaltap526 contact-id
  • Computers and Intractability : A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
    (15 January 1979)
    by MR Garey, DS Johnson
    posted to complexity mythesis theory by eporreca on 2008-03-05 09:57:37 as ** along with 11 people creswick greenw ima danielaugot chechetka lcigler fdr Fin payton345 djlin tkollar
  • Computational Complexity
    (30 November 1993)
    by Christos H Papadimitriou
    posted to complexity mythesis theory by eporreca on 2008-03-05 09:20:19 as ** along with 4 people JakubSzymanik BarrosH gagliol masteraka
  • Exploring Computation Trees Associated with P Systems
    Membrane Computing (2005), pp. 278-286.
    by Andrés Cordón-Franco, Miguel A Gutiérrez-Naranjo, Mario J Pérez-Jiménez, Agustín Riscos-Núñez
    posted to computation dependency graph mythesis p-systems trees by eporreca on 2008-03-04 15:52:15 as **
  • On the Power of Dissolution in P Systems with Active Membranes
    Membrane Computing (2006), pp. 224-240.
    by Miguel Gutiérrez–naranjo, Mario Pérez–jiménez, Agustín Riscos–núñez, Francisco Romero–campero
    posted to complexity dependency graph mythesis p-systems theory by eporreca on 2008-03-04 15:50:23 as **
  • Computability and Recursion
    The Bulletin of Symbolic Logic, Vol. 2, No. 3. (1996), pp. 284-321.
    by Robert I Soare
    posted to church computability machine recursion thesis turing by eporreca on 2008-03-04 14:01:20 as **
  • On the degree of parallelism in membrane systems
    Theoretical Computer Science, Vol. 372, No. 2-3. (15 March 2007), pp. 183-195.
    by Miguel A Gutierrez-Naranjo, Mario J Perez-Jimenez, Agustin Riscos-Nunez
    posted to degree dependency graph parallelism p-systems by eporreca on 2008-03-03 16:36:23 as **
  • P Systems with Active Membranes Characterize PSPACE
    DNA Computing (2006), pp. 33-46.
    by Petr Sosík, Alfonso Rodríguez-Patón
    posted to complexity mythesis pspace p-systems theory by eporreca on 2008-03-03 14:17:23 as **
  • Computational Complexity: A Modern Approach (Draft)
    (January 2007)
    by Sanjeev Arora, Boaz Barak
    posted to book complexity mythesis theory by eporreca on 2008-02-27 09:05:06 as **
  • A hierarchy for nondeterministic time complexity
    (1972), pp. 187-192.
    by Stephen A Cook
    posted to complexity mythesis nondeterminism theory by eporreca on 2008-02-27 09:00:35 as **
  • Proceedings of the Eighth Workshop on Membrane Computing (WMC8)
    (June 2007)
    edited by George Eleftherakis, Petros Kefalas, Gheorghe Păun
    posted to mythesis proceedings p-systems by eporreca on 2008-02-26 09:07:09 as **
  • P Systems Generating Trees
    Membrane Computing (2005), pp. 309-319.
    by Rudolf Freund, Marion Oswald, Andrei Păun
    posted to mythesis p-systems trees by eporreca on 2008-02-26 08:40:48 as **
  • Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode
    Unconventional Computation (2007), pp. 62-76.
    by Rudolf Freund, Gheorghe Păun, Mario Pérez-Jiménez
    posted to complexity mythesis p-systems theory by eporreca on 2008-02-26 08:34:25 as **
  • On the Abstract Properties of Linear Dependence
    American Journal of Mathematics, Vol. 57, No. 3. (1935), pp. 509-533.
    by Hassler Whitney
    posted to math matroid theory by eporreca on 2008-02-19 14:40:39 as **
  • The Number of Trees
    by Richard Otter
    posted to graph mythesis theory trees by eporreca on 2008-02-19 14:31:47 as **
  • P systems with minimal parallelism
    Theoretical Computer Science, Vol. 378, No. 1. (3 June 2007), pp. 117-130.
    by Gabriel Ciobanu, Linqiang Pan, Gheorghe Paun, Mario J Perez-Jimenez
    posted to complexity minimal mythesis parallelism p-systems by eporreca on 2008-02-12 16:07:11 as **
  • A growing neural gas network learns topologies
    (1995), pp. 625-632.
    by Bernd Fritzke
    edited by G Tesauro, DS Touretzky, TK Leen
    posted to gas learning machine nets neural topology by eporreca on 2007-12-21 15:55:06 as **
  • A Model for Molecular Computing: Membrane Systems
    (2001)
    by Claudio Zandron
    posted to complexity mythesis p-systems theory thesis by eporreca on 2007-12-21 10:56:22 as **
  • Elements of Set Theory
    (28 April 1977)
    by Herbert B Enderton
    posted to logic mythesis set theory by eporreca on 2007-12-17 15:38:59 as **
  • An Approach to Computational Complexity in Membrane Computing
    Membrane Computing (2005), pp. 85-109.
    by Mario J Pérez-Jiménez
    posted to classes complexity mythesis p-systems theory by eporreca on 2007-12-16 19:32:52 as **
  • On Polynomial Time Computable Numbers
    (16 Aug 2006)
    by Tetsushi Matsui
    posted to algebra algebraically closed complexity computability computable field numbers polynomial time by eporreca on 2007-12-16 13:44:34 as ** along with 4 people ansobol jrw proportional dmitri83
  • On the rank of semimodules over semirings
    Collectanea Matematica, No. 46. (1995), pp. 83-95.
    by U Hebisch, HJ Weinert
    posted to algebra math mythesis rank semimodules semirings by eporreca on 2007-12-14 16:41:01 as **
  • Algebraic and Coalgebraic Aspects of Membrane Computing
    Membrane Computing (2006), pp. 181-198.
    by Gabriel Ciobanu, Viorel Gontineac
    posted to algebra multisets mythesis p-systems semimodules semirings by eporreca on 2007-12-14 16:29:17 as **
  • Complexity classes in models of cellular computing with membranes
    Natural Computing, Vol. 2, No. 3. (2003), pp. 265-285.
    by Mario J Jiménez, Álvaro R Jiménez, Fernando S Caparrini
    posted to classes complexity definitions mythesis p-systems theory by eporreca on 2007-12-14 09:36:39 as **
  • Algorithms for solving systems of linear diophantine equations in integer domains
    Cybernetics and Systems Analysis, Vol. 42, No. 2. (13 March 2006), pp. 163-175.
    by S Kryvyi
    posted to algorithms basis diophantine equations integers math mythesis by eporreca on 2007-12-13 20:38:32 as ** along with 1 person Scis0000002
  • Time-Space Tradeoffs for Nondeterministic Computation
    (2000)
    by Lance Fortnow, Dieter Van Melkebeek
    posted to linear mythesis nondeterminism nram time by eporreca on 2007-12-10 16:57:26 as **
  • Monadic logical definability of nondeterministic linear time
    Computational Complexity, Vol. 7, No. 1. (2 July 1998), pp. 54-97.
    by Grandjean, F Olive
    posted to complexity mythesis nondeterminism nram theory by eporreca on 2007-12-10 16:20:42 as **
  • Measuring nondeterminism in pushdown automata
    Journal of Computer and System Sciences, Vol. 71, No. 4. (November 2005), pp. 440-466.
    by Jonathan Goldstine, Hing Leung, Detlef Wotschke
    posted to automata complexity context-free mythesis nondeterminism pushdown by eporreca on 2007-12-10 15:50:34 as **
    • Note: You may cite this page as: http://www.citeulike.org/user/eporreca

    Result page: 1 2 Next 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.