Регистрация | Вход в службу | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

AbnerCYH complexity [104 articles]

Recent papers added to AbnerCYH library classified by the tag complexity. You can also see everyone's complexity.
  • 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 complexity by AbnerCYH on 2008-05-15 02:40:41 as **
  • Information measures, effective complexity, and total information
    Complexity, Vol. 2, No. 1. (1996), pp. 44-52.
    by Murray Gell-Mann, Seth Lloyd
    posted to information complexity complex by AbnerCYH on 2008-05-02 16:05:20 as ** along with 3 people zambujo itmeson abominable
  • Hierarchical structure and the prediction of missing links in networks
    Nature, Vol. 453, No. 7191., pp. 98-101.
    by Aaron Clauset, Cristopher Moore, MEJ Newman
    posted to graph complexity algorithms by AbnerCYH on 2008-05-02 08:41:08 as ** along with 24 people pbull jago Ema gtgt15 hryk nedwards i-stevenson pinney elsantosneto markusd eyliu craigwilson06 jyuh margaritis gagliol bryanhughes akshat tmmurali cactus tny briordan deanmalmgren soramame_0518 jjray
  • Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)
    (11 June 2007)
    by Erich Grädel, Phokion G Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y Vardi, Yde Venema, Scott Weinstein
    posted to complexity logic math by AbnerCYH on 2008-04-22 06:10:52 as ** along with 3 people JakubSzymanik leonardo masteraka
  • Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)
    (26 July 2000)
    by Peter Bürgisser
    posted to algebra complexity by AbnerCYH on 2008-04-21 19:12:08 as **
  • Statistical Learning Theory
    (16 September 1998)
    by Vladimir N Vapnik
    posted to complexity kdd stochastic by AbnerCYH on 2008-04-21 19:11:57 as ** along with 11 people and 3 groups yaroslavvb gyuli grzegorz sdvillal archroad paolo abrentnall bundschu johnkork navil shimazaki Bioinformatics QFRMC_ConsumerCredit generif_paper
  • An Introduction to Computational Learning Theory
    (15 August 1994)
    by Michael J Kearns, Umesh V Vazirani
    posted to complexity kdd stochastic by AbnerCYH on 2008-04-15 14:58:10 as ** along with 3 people and 1 group dsilva BarrosH spirit_of_numenor ComplexAdaptiveSystems
  • Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
    SIAM Journal on Computing, Vol. 28, No. 1. (1998), pp. 105-136.
    by Thomas H Cormen, Thomas Sundquist, Leonard F Wisniewski
    posted to algorithms complexity data_structure parallel by AbnerCYH on 2008-04-03 04:38:17 as **
  • The Complexity of the Partial Order Dimension Problem
    SIAM Journal on Algebraic and Discrete Methods, Vol. 3, No. 3. (1982), pp. 351-358.
    by Mihalis Yannakakis
    posted to complexity order by AbnerCYH on 2008-04-01 02:39:32 as ** along with 2 people Scis0000002 walp
  • A theory of the learnable
    Commun. ACM, Vol. 27, No. 11. (November 1984), pp. 1134-1142.
    by LG Valiant
    posted to algorithms complexity kdd stochastic by AbnerCYH on 2008-03-29 07:16:02 as ** along with 5 people mthomure sdvillal dwf mangesh bsilverthorn
  • A Tutorial on Support Vector Machines for Pattern Recognition
    Data Min. Knowl. Discov., Vol. 2, No. 2. (June 1998), pp. 121-167.
    by Christopher JC Burges
    posted to algorithms complexity kdd by AbnerCYH on 2008-03-28 15:42:38 as ** along with 9 people and 1 group joelh zoop drivard kgajos Mohan-S tgyork vlachmore dcastro asterix77 LIVIA
  • Fixed-Parameter Tractability, Definability, and Model-Checking
    SIAM Journal on Computing, Vol. 31, No. 1. (2001), pp. 113-145.
    by Jörg Flum, Martin Grohe
    posted to algorithms complexity graph logic parameterized by AbnerCYH on 2008-03-26 09:20:30 as **
  • A Variant to Turing's Theory of Computing Machines
    J. ACM, Vol. 4, No. 1. (January 1957), pp. 63-92.
    by Hao Wang
    posted to complexity by AbnerCYH on 2008-03-25 08:42:10 as **
  • What is a pointer machine?
    SIGACT News, Vol. 26, No. 2. (June 1995), pp. 88-95.
    by Amir M Ben-Amram
    posted to algorithms complexity by AbnerCYH on 2008-03-24 18:24:14 as **
  • Expected time bounds for selection
    Commun. ACM, Vol. 18, No. 3. (March 1975), pp. 165-172.
    by Robert W Floyd, Ronald L Rivest
    posted to algorithms complexity by AbnerCYH on 2008-03-18 05:00:45 as **
  • If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
    Computational Complexity, Vol. 16, No. 4. (29 December 2007), pp. 412-441.
    by Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
    posted to complexity by AbnerCYH on 2008-02-18 22:09:01 as **
  • Adaptive sorting: an information theoretic perspective
    Acta Informatica, Vol. 45, No. 1. (19 February 2008), pp. 33-42.
    by Amr Elmasry, Michael Fredman
    posted to algorithms complexity information by AbnerCYH on 2008-02-08 21:53:47 as **
  • Zero-Knowledge Proofs of the Conjugacy for Permutation Groups
    (31 Jan 2008)
    by Oleg Verbitsky
    posted to algebra algorithms combinatorics complexity by AbnerCYH on 2008-02-02 06:13:18 as **
  • An optimal minimum spanning tree algorithm
    J. ACM, Vol. 49, No. 1. (January 2002), pp. 16-34.
    by Seth Pettie, Vijaya Ramachandran
    posted to algorithms complexity graph by AbnerCYH on 2008-01-24 19:35:31 as **
  • Minimization of decision trees is hard to approximate
    Journal of Computer and System Sciences, Vol. 74, No. 3. (May 2008), pp. 394-403.
    by Detlef Sieling
    posted to algorithms complexity kdd logic by AbnerCYH on 2008-01-22 14:44:55 as **
  • Open problems around exact algorithms
    Discrete Applied Mathematics, Vol. 156, No. 3. (1 February 2008), pp. 397-405.
    by Gerhard J Woeginger
    posted to algorithms complexity by AbnerCYH on 2008-01-14 07:58:12 as **
  • Kolmogorov complexities Kmax, Kmin on computable partially ordered sets
    (2 Jan 2008)
    by Marie Ferbus-Zanda, Serge Grigorieff
    posted to algorithms complexity logic order by AbnerCYH on 2008-01-04 12:39:07 as ** along with 1 person A_Olympia
  • Is Randomness "Native" to Computer Science?
    (1 Jan 2008)
    by Marie Ferbus-Zanda, Serge Grigorieff
    posted to complexity logic math by AbnerCYH on 2008-01-04 12:36:43 as ** along with 1 person ansobol
  • Computer algebra in systems biology
    (27 Dec 2007)
    by Reinhard Laubenbacher, Bernd Sturmfels
    posted to algebra algorithms biology complex complexity math by AbnerCYH on 2007-12-28 08:52:39 as **
  • On Two Techniques of Combining Branching and Treewidth
    Algorithmica
    by Fedor Fomin, Serge Gaspers, Saket Saurabh, Alexey Stepanov
    posted to algorithms complexity graph math optimization parameterized by AbnerCYH on 2007-12-19 05:34:12 as **
  • Improved Algorithms and Complexity Results for Power Domination in Graphs
    Algorithmica
    by Jiong Guo, Rolf Niedermeier, Daniel Raible
    posted to algorithms complexity graph parameterized by AbnerCYH on 2007-12-10 04:31:52 as **
  • On Fixed-Parameter Tractability and Approximability of NP Optimization Problems
    Journal of Computer and System Sciences, Vol. 54, No. 3. (June 1997), pp. 465-474.
    by Liming Cai, Jianer Chen
    posted to algorithms complexity optimization parameterized by AbnerCYH on 2007-11-15 09:25:10 as **
  • Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
    Parameterized and Exact Computation (2006), pp. 96-108.
    by Liming Cai, Xiuzhen Huang
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-13 17:12:36 as **
  • Parameterized Approximation Problems
    Parameterized and Exact Computation (2006), pp. 121-129.
    by Rodney Downey, Michael Fellows, Catherine Mccartin
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-13 17:09:55 as **
  • Parameterized complexity and polynomial-time approximation schemes
    (December 2004)
    by Xiuzhen Huang
    posted to algorithms complexity optimization parameterized by AbnerCYH on 2007-11-13 10:34:03 as **
  • Minimum Membership Set Covering and the Consecutive Ones Property
    Algorithm Theory – SWAT 2006 (2006), pp. 339-350.
    by Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
    posted to algorithms biology complexity parameterized by AbnerCYH on 2007-11-11 18:09:19 as **
  • On The Parameterized Intractability Of Motif Search Problems
    Combinatorica, Vol. 26, No. 2. (30 April 2006), pp. 141-167.
    by Michael Fellows, Jens Gramm, Rolf Niedermeier
    posted to biology combinatorics complexity graph parameterized by AbnerCYH on 2007-11-10 19:08:20 as **
  • Parameterized Complexity and Biopolymer Sequence Comparison
    The Computer Journal, Vol. 51, No. 3. (27 June 2007), bxm035.
    by Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances Rosamond, Yinglei Song
    posted to biology complexity parameterized by AbnerCYH on 2007-11-10 18:58:22 as **
  • On the Parameterized Intractability of CLOSEST SUBSTRING and Related Problems
    STACS 2002: 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002. Proceedings (2002), pp. 734-734.
    by Michael R Fellows, Jens Gramm, Rolf Niedermeier
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-10 12:15:48 as **
  • On the strength of comparisons in property testing
    Information and Computation, Vol. 189, No. 1. (25 February 2004), pp. 107-116.
    by Eldar Fischer
    posted to algorithms complexity testing by AbnerCYH on 2007-11-10 12:14:37 as *****
  • Fixed-parameter tractability and completeness II: On completeness for W[1]
    Theoretical Computer Science, Vol. 141, No. 1-2. (17 April 1995), pp. 109-131.
    by Rod G Downey, Michael R Fellows
    posted to complexity parameterized by AbnerCYH on 2007-11-10 09:34:03 as **
  • Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications)
    (20 March 2006)
    by Rolf Niedermeier
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-10 08:38:48 as **
  • Complexity measures and decision tree complexity: a survey
    Theoretical Computer Science, Vol. 288, No. 1. (9 October 2002), pp. 21-43.
    by Harry Buhrman, Ronald de Wolf
    posted to algorithms complexity logic by AbnerCYH on 2007-11-08 18:40:15 as **
  • Polynomial time approximation schemes and parameterized complexity
    Discrete Appl. Math., Vol. 155, No. 2. (January 2007), pp. 180-193.
    by Jianer Chen, Xiuzhen Huang, Iyad A Kanj, Ge Xia
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-08 18:10:38 as **
  • Parameterized Complexity and Approximation Algorithms
    The Computer Journal (28 July 2007), bxm048.
    by Daaniel Marx
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-08 18:10:33 as ** along with 1 person Kcl
  • Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem
    (2004), pp. 155-164.
    by Irit Dinur, Omer Reingold
    posted to algorithms combinatorics complexity by AbnerCYH on 2007-11-08 17:14:31 as **
  • Infeasibility of Instance Compression and Succinct PCPs for NP
    No. TR07-096. (2007)
    by Lance Fortnow, Rahul Santhanam
    posted to complexity information parameterized by AbnerCYH on 2007-11-08 17:00:54 as **
  • notes On Parameterized Approximability
    Vol. TR07-106 (28 October 2007)
    by Yijia Chen, Martin Grohe, Magdalena Gruber
    posted to complexity parameterized by AbnerCYH on 2007-11-06 11:20:37 as **
  • Computability, Complexity and Constructivity in Economic Analysis. Edited by K. VELA VILLAPILLAI
    Economica, Vol. 74, No. 295. (August 2007), pp. 566-567.
    by Steven Durlauf
    posted to algorithms complex complexity economic by AbnerCYH on 2007-11-04 18:57:00 as ** along with 1 person Scis0000002
  • Analytic combinatorics: a calculus of discrete structures
    (2007), pp. 137-148.
    by Philippe Flajolet
    posted to algorithms combinatorics complexity by AbnerCYH on 2007-10-27 16:53:16 as **
  • Should Tables Be Sorted?
    J. ACM, Vol. 28, No. 3. (July 1981), pp. 615-628.
    by Andrew C Yao
    posted to algorithms complexity data_structure order by AbnerCYH on 2007-10-23 14:21:19 as ** along with 1 person mangesh
  • Every decision tree has an influential variable
    (2005), pp. 31-39.
    by Ryan O'Donnell, Michael Saks, Oded Schramm
    posted to combinatorics complexity order by AbnerCYH on 2007-10-23 10:20:47 as **
  • Products and Help Bits in Decision Trees
    SIAM Journal on Computing, Vol. 28, No. 3. (1998), pp. 1035-1050.
    by Noam Nisan, Steven Rudich, Michael Saks
    posted to algorithms complexity order stochastic by AbnerCYH on 2007-10-23 10:16:14 as **
  • Size-depth trade-offs for threshold circuits
    (1993), pp. 541-550.
    by Russell Impagliazzo, Ramamohan Paturi, Michael E Saks
    posted to complexity logic by AbnerCYH on 2007-10-23 10:12:03 as **
  • Time-space trade-off lower bounds for randomized computation of decision problems
    J. ACM, Vol. 50, No. 2. (March 2003), pp. 154-195.
    by Paul Beame, Michael Saks, Xiaodong Sun, Erik Vee
    posted to algorithms complexity stochastic by AbnerCYH on 2007-10-23 10:11:19 as ** along with 1 person BarrosH
    • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/user/AbnerCYH/tag/complexity

    Result page: 1 2 3 Next RIS BibTeX RSS
    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.