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

eporreca's theory [35 articles]

Recent papers added to eporreca's library classified by the tag theory. You can also see everyone's theory.
  • Nondeterministic space is closed under complementation
    Structure in Complexity Theory Conference, 1988. Proceedings., Third Annual (1988), pp. 112-115.
    by N Immerman
    posted to closure complementation complexity nondeterminism space theory by eporreca on 2008-08-26 08:59:48 as **
  • 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 complexity knot theory topology 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 complexity gap theorem theory 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 complexity np-complete reductions theory by eporreca on 2008-07-01 12:53:29 as ** along with 1 person NinaG
  • Word problems requiring exponential time(Preliminary Report)
    (1973), pp. 1-9.
    by LJ Stockmeyer, AR Meyer
    posted to complexity exponential expressions regular theory time by eporreca on 2008-06-08 13:58:51 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 complexity mythesis pspace p-systems qbf theory 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 circuits complexity integers mythesis theory 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 complexity mythesis np-complete sat theory by eporreca on 2008-05-13 15:47:42 as ** along with 6 people stavros sdvillal bsilverthorn voronov dfabbri JakubSzymanik
  • 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 complexity mythesis pspace p-systems qbf theory 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 complexity equilibrium games graphs mythesis nash nexp-complete theory 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 **
  • 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 12 people gale82 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 BarrosH gagliol masteraka JakubSzymanik
  • 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 **
  • 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 **
  • 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 **
  • 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 **
  • 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 **
  • 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 **
  • Context-free grammars on trees
    (1969), pp. 143-148.
    by William C Rounds
    posted to context-free formal grammars languages mythesis theory trees by eporreca on 2007-12-03 18:02:50 as **
  • Tree Automata Techniques and Applications
    (1997)
    by H Comon, M Dauchet, R Gilleron, F Jacquemard, D Lugiez, S Tison, M Tommasi
    posted to automata formal grammars languages mythesis theory trees by eporreca on 2007-11-30 13:08:10 as ** along with 1 person and 1 group mahler Rightscom
  • On Systems of Linear Diophantine Equations
    Mathematics Magazine, Vol. 69, No. 4. (1996), pp. 261-266.
    by Felix Lazebnik
    posted to diophantine equations integers linear math mythesis number theory by eporreca on 2007-11-28 09:50:54 as **
  • Measures of Nondeterminism in Finite Automata
    Automata, Languages and Programming (2000), 199.
    by Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
    posted to automata communication complexity dfa nfa nondeterminism theory by eporreca on 2007-11-27 10:38:38 as ** along with 2 people estrabd ansobol
  • Membrane computing and complexity theory: A characterization of PSPACE
    Journal of Computer and System Sciences, Vol. 73, No. 1. (February 2007), pp. 137-152.
    by Petr Sosik, Alfonso Rodriguez-Paton
    posted to complexity mythesis pspace p-systems simulation theory by eporreca on 2007-11-27 10:33:54 as **
  • Proof Theory and Philosophy (draft)
    (September 2006)
    by Greg Restall
    posted to logic philosophy proof theory by eporreca on 2007-08-23 10:56:44 as **
    • Note: You may cite this page as: http://www.citeulike.org/user/eporreca/tag/theory

    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.