SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Rezende F) "

Search: WFRF:(Rezende F)

  • Result 1-10 of 23
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Hyde, K. D., et al. (author)
  • Global consortium for the classification of fungi and fungus-like taxa
  • 2023
  • In: MYCOSPHERE. - : Mushroom Research Foundation. - 2077-7000 .- 2077-7019. ; 14:1, s. 1960-2012
  • Journal article (peer-reviewed)abstract
    • The Global Consortium for the Classification of Fungi and fungus-like taxa is an international initiative of more than 550 mycologists to develop an electronic structure for the classification of these organisms. The members of the Consortium originate from 55 countries/regions worldwide, from a wide range of disciplines, and include senior, mid-career and early-career mycologists and plant pathologists. The Consortium will publish a biannual update of the Outline of Fungi and fungus-like taxa, to act as an international scheme for other scientists. Notes on all newly published taxa at or above the level of species will be prepared and published online on the Outline of Fungi website (https://www.outlineoffungi.org/), and these will be finally published in the biannual edition of the Outline of Fungi and fungus-like taxa. Comments on recent important taxonomic opinions on controversial topics will be included in the biannual outline. For example, 'to promote a more stable taxonomy in Fusarium given the divergences over its generic delimitation', or 'are there too many genera in the Boletales?' and even more importantly, 'what should be done with the tremendously diverse 'dark fungal taxa?' There are undeniable differences in mycologists' perceptions and opinions regarding species classification as well as the establishment of new species. Given the pluralistic nature of fungal taxonomy and its implications for species concepts and the nature of species, this consortium aims to provide a platform to better refine and stabilise fungal classification, taking into consideration views from different parties. In the future, a confidential voting system will be set up to gauge the opinions of all mycologists in the Consortium on important topics. The results of such surveys will be presented to the International Commission on the Taxonomy of Fungi (ICTF) and the Nomenclature Committee for Fungi (NCF) with opinions and percentages of votes for and against. Criticisms based on scientific evidence with regards to nomenclature, classifications, and taxonomic concepts will be welcomed, and any recommendations on specific taxonomic issues will also be encouraged; however, we will encourage professionally and ethically responsible criticisms of others' work. This biannual ongoing project will provide an outlet for advances in various topics of fungal classification, nomenclature, and taxonomic concepts and lead to a community-agreed classification scheme for the fungi and fungus-like taxa. Interested parties should contact the lead author if they would like to be involved in future outlines.
  •  
2.
  •  
3.
  • Crous, P. W., et al. (author)
  • Fungal Planet description sheets: 1478-1549
  • 2023
  • In: Persoonia. - 0031-5850. ; 50, s. 158-310
  • Journal article (peer-reviewed)abstract
    • Novel species of fungi described in this study include those from various countries as follows: Australia, Aschersonia mackerrasiae on whitefly, Cladosporium corticola on bark of Melaleuca quinquenervia, Penicillium nudgee from soil under Melaleuca quinquenervia, Pseudocercospora blackwoodiae on leaf spot of Persoonia fal- cata, and Pseudocercospora dalyelliae on leaf spot of Senna alata. Bolivia, Aspicilia lutzoniana on fully submersed siliceous schist in high-mountain streams, and Niesslia parviseta on the lower part and apothecial discs of Erioderma barbellatum on a twig. Brazil, Cyathus bonsai on decaying wood, Geastrum albofibrosum from moist soil with leaf litter, Laetiporus pratigiensis on a trunk of a living unknown hardwood tree species, and Scytalidium synnematicum on dead twigs of unidentified plant. Bulgaria, Amanita abscondita on sandy soil in a plantation of Quercus suber. Canada, Penicillium acericola on dead bark of Acer saccharum, and Penicillium corticola on dead bark of Acer saccharum. China, Colletotrichum qingyuanense on fruit lesion of Capsicum annuum. Denmark, Helminthosphaeria leptospora on corticioid Neohypochnicium cremicolor. Ecuador (Galapagos), Phaeosphaeria scalesiae on Scalesia sp. Finland, Inocybe jacobssonii on calcareous soils in dry forests and park habitats. France, Cortinarius rufomyr- rheus on sandy soil under Pinus pinaster, and Periconia neominutissima on leaves of Poaceae. India, Coprinopsis fragilis on decaying bark of logs, Filoboletus keralensis on unidentified woody substrate, Penicillium sankaranii from soil, Physisporinus tamilnaduensis on the trunk of Azadirachta indica, and Poronia nagaraholensis on elephant dung. Iran, Neosetophoma fici on infected leaves of Ficus elastica. Israel, Cnidariophoma eilatica (incl. Cnidario- phoma gen. nov.) from Stylophora pistillata. Italy, Lyophyllum obscurum on acidic soil. Namibia, Aureobasidium faidherbiae on dead leaf of Faidherbia albida, and Aureobasidium welwitschiae on dead leaves of Welwitschia mirabilis. Netherlands, Gaeumannomycella caricigena on dead culms of Carex elongata, Houtenomyces caricicola (incl. Houtenomyces gen. nov.) on culms of Carex disticha, Neodacampia ulmea (incl. Neodacampia gen. nov.) on branch of Ulmus laevis, Niesslia phragmiticola on dead standing culms of Phragmites australis, Pseudopyricularia caricicola on culms of Carex disticha, and Rhodoveronaea nieuwwulvenica on dead bamboo sticks. Norway, Arrhenia similis half-buried and moss-covered pieces of rotting wood in grass-grown path. Pakistan, Mallocybe ahmadii on soil. Poland, Beskidomyces laricis (incl. Beskidomyces gen. nov.) from resin of Larix decidua ssp. polonica, Lapi- domyces epipinicola from sooty mould community on Pinus nigra, and Leptographium granulatum from a gallery of Dendroctonus micans on Picea abies. Portugal, Geoglossum azoricum on mossy areas of laurel forest areas planted with Cryptomeria japonica, and Lunasporangiospora lusitanica from a biofilm covering a biodeteriorated limestone wall. Qatar, Alternaria halotolerans from hypersaline sea water, and Alternaria qatarensis from water sample collected from hypersaline lagoon. South Africa, Alfaria thamnochorti on culm of Thamnochortus fraternus, Knufia aloeicola on Aloe gariepensis, Muriseptatomyces restionacearum (incl. Muriseptatomyces gen. nov. ) on culms of Restionaceae, Neocladosporium arctotis on nest of cases of bag worm moths (Lepidoptera, Psychidae) on Arctotis auriculata, Neodevriesia scadoxi on leaves of Scadoxus puniceus, Paraloratospora schoenoplecti on stems of Schoenoplectus lacustris, Tulasnella epidendrea from the roots of Epidendrum x obrienianum, and Xenoidriella cinnamomi (incl. Xenoidriella gen. nov.) on leaf of Cinnamomum camphora. South Korea, Lemonniera fraxinea on decaying leaves of Fraxinus sp. from pond. Spain, Atheniella lauri on the bark of fallen trees of Laurus nobilis, Halocryptovalsa endophytica from surface-sterilised, asymptomatic roots of Salicornia patula, Inocybe amygda- liolens on soil in mixed forest, Inocybe pityusarum on calcareous soil in mixed forest, Inocybe roseobulbipes on acidic soils, Neonectria borealis from roots of Vitis berlandieri x Vitis rupestris, Sympoventuria eucalyptorum on leaves of Eucalyptus sp., and Tuber conchae from soil. Sweden, Inocybe bidumensis on calcareous soil. Thailand, Cordyceps sandindaengensis on Lepidoptera pupa, buried in soil, Ophiocordyceps kuchinaraiensis on Coleoptera larva, buried in soil, and Samsoniella winandae on Lepidoptera pupa, buried in soil. Taiwan region (China), Neo- phaeosphaeria livistonae on dead leaf of Livistona rotundifolia. Turkiye, Melanogaster anatolicus on clay loamy soils. UK, Basingstokeomyces allii (incl. Basingstokeomyces gen. nov.) on leaves of Allium schoenoprasum. Ukraine, Xenosphaeropsis corni on recently dead stem of Cornus alba. USA, Nothotrichosporon aquaticum (incl. Nothotrichosporon gen. nov.) from water, and Periconia philadelphiana from swab of coil surface. Morphological and culture characteristics for these new taxa are supported by DNA barcodes.
  •  
4.
  • Alwen, Joël, et al. (author)
  • Cumulative Space in Black-White Pebbling and Resolution
  • 2017
  • In: Leibniz International Proceedings in Informatics, LIPIcs. - : Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. - 9783959770293
  • Conference paper (peer-reviewed)abstract
    • We study space complexity and time-space trade-offs with a focus not on peak memory usage but on overall memory consumption throughout the computation. Such a cumulative space measure was introduced for the computational model of parallel black pebbling by [Alwen and Serbinenko 2015] as a tool for obtaining results in cryptography. We consider instead the nondeterministic black-white pebble game and prove optimal cumulative space lower bounds and trade-offs, where in order to minimize pebbling time the space has to remain large during a significant fraction of the pebbling. We also initiate the study of cumulative space in proof complexity, an area where other space complexity measures have been extensively studied during the last 10-15 years. Using and extending the connection between proof complexity and pebble games in [Ben-Sasson and Nordström 2008, 2011], we obtain several strong cumulative space results for (even parallel versions of) the resolution proof system, and outline some possible future directions of study of this, in our opinion, natural and interesting space measure.
  •  
5.
  • Atserias, Albert, et al. (author)
  • Clique Is Hard on Average for Regular Resolution
  • 2018
  • In: STOC'18. - New York, NY, USA : ASSOC COMPUTING MACHINERY. ; , s. 866-877
  • Conference paper (peer-reviewed)abstract
    • We prove that for k << (4)root n regular resolution requires length n(Omega(k)) to establish that an Erdos Renyi graph with appropriately chosen edge density does not contain a k-clique. This lower bound is optimal up to the multiplicative constant in the exponent, and also implies unconditional n(Omega(k)) lower bounds on running time for several state-of-the-art algorithms for finding maximum cliques in graphs.
  •  
6.
  • Atserias, Albert, et al. (author)
  • Clique Is Hard on Average for Regular Resolution
  • 2021
  • In: Journal of the ACM. - : Association for Computing Machinery (ACM). - 0004-5411 .- 1557-735X. ; 68:4, s. 1-26
  • Journal article (peer-reviewed)abstract
    • We prove that for k ≫; 4√n regular resolution requires length nω(k) to establish that an ErdÅ's-Rényi graph with appropriately chosen edge density does not contain a k-clique. This lower bound is optimal up to the multiplicative constant in the exponent and also implies unconditional nω(k) lower bounds on running time for several state-of-the-art algorithms for finding maximum cliques in graphs.
  •  
7.
  • Conneryd, Jonas, et al. (author)
  • Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
  • 2023
  • In: Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023. - 0272-5428. - 9798350318944 ; , s. 1-11
  • Conference paper (peer-reviewed)abstract
    • We prove that polynomial calculus (and hence also Nullstellensatz) over any field requires linear degree to refute that sparse random regular graphs, as well as sparse Erdős-Rényi random graphs, are 3-colourable.
  •  
8.
  • De Rezende, Susanna F., et al. (author)
  • Automating algebraic proof systems is NP-hard
  • 2021
  • In: STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. - New York, NY, USA : ACM. - 0737-8017. - 9781450380539 ; , s. 209-222
  • Conference paper (peer-reviewed)abstract
    • We show that algebraic proofs are hard to find: Given an unsatisfiable CNF formula F, it is NP-hard to find a refutation of F in the Nullstellensatz, Polynomial Calculus, or Sherali-Adams proof systems in time polynomial in the size of the shortest such refutation. Our work extends, and gives a simplified proof of, the recent breakthrough of Atserias and Müller (JACM 2020) that established an analogous result for Resolution.
  •  
9.
  • De Rezende, Susanna F., et al. (author)
  • Clique Is Hard on Average for Unary Sherali-Adams
  • 2023
  • In: Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023. - 0272-5428. - 9798350318944 ; , s. 12-25
  • Conference paper (peer-reviewed)abstract
    • We prove that unary Sherali-Adams requires proofs of size nΩ(d) to rule out the existence of an nΘ(1)-clique in Erdős-Rényi random graphs whose maximum clique is of size d ≤ 2 log n. This lower bound is tight up to the multiplicative constant in the exponent. We obtain this result by introducing a technique inspired by pseudo-calibration which may be of independent interest. The technique involves defining a measure on monomials that precisely captures the contribution of a monomial to a refutation. This measure intuitively captures progress and should have further applications in proof complexity.
  •  
10.
  • de Rezende, Susanna F., et al. (author)
  • Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
  • 2020
  • In: CCC '20: Proceedings of the 35th Computational Complexity Conference 2020. - : Schloss Dagstuhl–Leibniz-Zentrum für Informatik. - 1868-8969. - 9783959771566 ; 169, s. 28-1
  • Conference paper (peer-reviewed)abstract
    • We show exponential lower bounds on resolution proof length for pigeonhole principle (PHP) formulas and perfect matching formulas over highly unbalanced, sparse expander graphs, thus answering the challenge to establish strong lower bounds in the regime between balanced constant-degree expanders as in [Ben-Sasson and Wigderson'01] and highly unbalanced, dense graphs as in [Raz'04] and [Razborov'03,'04]. We obtain our results by revisiting Razborov's pseudo-width method for PHP formulas over dense graphs and extending it to sparse graphs. This further demonstrates the power of the pseudo-width method, and we believe it could potentially be useful for attacking also other longstanding open problems for resolution and other proof systems.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-10 of 23

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view