Register | Log in | FAQ      [?] 

Tag mythesis [45 articles]

Recent papers classified by the tag mythesis.
  • 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 **
  • 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 **
  • 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 **
  • Introduction to Automata Theory, Languages, and Computation (2nd Edition)
    (14 November 2000)
    by John E Hopcroft, Rajeev Motwani, Jeffrey D Ullman
    posted to automata complexity computability context-free languages mythesis regular by eporreca on 2008-05-13 09:15:27 as ** along with 6 people markusd sdvillal marciolima leidner whshen JakubSzymanik
  • 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 **
  • 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 **
  • 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 **
  • 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 **
  • 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
  • Computing with Membranes
    (1998)
    by Gheorghe Paun
    posted to mythesis p-systems by eporreca on 2008-06-10 10:15:35 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 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 **
  • Introduction to Algorithms, Second Edition
    (01 September 2001)
    by Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein
    posted to algorithms mythesis by eporreca on 2008-06-08 21:43:38 as ** along with 11 people jcheng dragonrez marciolima gurkanbebek tmarscha dodger042 napvasconcelos chandlerc csacca pawelt sven_luzar
  • Computing with Membranes
    Journal of Computer and System Sciences, Vol. 61, No. 1. (August 2000), pp. 108-143.
    by Gheorghe Paun
    posted to mythesis p-systems tutorial by eporreca on 2008-06-09 08:37:30 as ** along with 2 people and 4 groups balicea neveaire Biostatistics Computational-Genomics Bioinformatics Neuroscience
  • 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 **
  • 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 **
  • 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 **
  • 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 **
  • Computing with Membranes: Attacking NP-Complete Problems
    (2001), pp. 94-115.
    by Gheorghe Paun
    posted to active membranes mythesis np-complete p-systems by eporreca on 2008-06-08 11:38:03 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 **
  • 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 **
  • 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 **
  • 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 **
  • 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
  • Toward a Formal Macroset Theory
    Multiset Processing: Mathematical, Computer Science, and Molecular Computing Points of View (2001), 123.
    by Manfred Kudlek, Carlos Martín-Vide, Gheorghe Paun
    posted to formal grammars languages macrosets multisets mythesis rewriting systems by eporreca on 2007-11-27 10:31:25 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 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 **
  • Parsing Partially Ordered Multisets
    International Journal of Foundations of Computer Science, Vol. 8, No. 4. (1997), pp. 379-407.
    by Twan Basten
    posted to formal grammars languages multisets mythesis order parsing partial pomsets by eporreca on 2007-11-27 13:35:32 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
  • 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 **
  • 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 **
  • Membrane Computing
    (17 September 2002)
    by Gheorghe Paun
    posted to book mythesis p-systems by eporreca on 2008-06-19 13:00:02 as **
  • Introduction to Membrane Computing
    Applications of Membrane Computing (2006), pp. 1-42.
    by Gheorghe Păun
    posted to mythesis p-systems tutorial by eporreca on 2008-06-19 13:06:24 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 **
  • 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
  • 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 **
  • 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 **
  • 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 **
  • 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 **
  • On the complexity of integer programming
    J. ACM, Vol. 28, No. 4. (October 1981), pp. 765-768.
    by Christos H Papadimitriou
    posted to algorithms complexity integers mythesis programming pseudopolynomial by eporreca on 2007-12-04 14:41:47 as **
  • The Number of Trees
    by Richard Otter
    posted to graph mythesis theory trees by eporreca on 2008-02-19 14:31:47 as **
  • Integrating Vision and Touch for Object Recognition Tasks
    The International Journal of Robotics Research, Vol. 7, No. 6. (1 December 1988), pp. 15-33.
    by Peter K Allen
    posted to mythesis by barrieallen on 2008-01-26 13:57:25 as **
  • Complex Loci in human and mouse genomes.
    PLoS Genet, Vol. 2, No. 4. (April 2006)
    by PG Engström, H Suzuki, N Ninomiya, A Akalin, L Sessa, G Lavorgna, A Brozzi, L Luzi, SL Tan, L Yang, G Kunarso, EL Ng, S Batalov, C Wahlestedt, C Kai, J Kawai, P Carninci, Y Hayashizaki, C Wells, VB Bajic, V Orlando, JF Reid, B Lenhard, L Lipovich
    posted to mythesis by abrozzi on 2008-10-14 09:53:17 as ** along with 3 people jfr balicea tabu
  • High-resolution mapping of meiotic crossovers and non-crossovers in yeast
    Nature (09 July 2008)
    by Eugenio Mancera, Richard Bourgon, Alessandro Brozzi, Wolfgang Huber, Lars M Steinmetz
    posted to mythesis by abrozzi on 2008-10-14 09:52:48 as ** along with 8 people waszak Hans45 raiyar caseybrown djkt bpcusack jasontsai madhadron
  • MMTV insertional mutagenesis identifies genes, gene families and pathways involved in mammary cancer
    Nature Genetics, Vol. 39, No. 6. (29 April 2007), pp. 759-769.
    by Vassiliki Theodorou, Melanie A Kimm, Mandy Boer, Lodewyk Wessels, Wendy Theelen, Jos Jonkers, John Hilkens
    posted to mythesis by abrozzi on 2008-08-28 15:11:43 as **
    • Note: You may cite this page as: http://www.citeulike.org/tag/mythesis

    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.