المؤلفون: Nasiba Abdullaeva

المصدر: International Journal on Integrated Education; Vol. 4 No. 5 (2021): IJIE; 299-304 ; 2620-3502 ; 2615-3785 ; 10.31149/ijie.v4i5

مصطلحات موضوعية: Culture, enlightenment, value, artistic image, evil, lowness

وصف الملف: application/pdf

Relation: https://journals.researchparks.org/index.php/IJIE/article/view/1837/1791; https://journals.researchparks.org/index.php/IJIE/article/view/1837

الاتاحة: https://journals.researchparks.org/index.php/IJIE/article/view/1837
https://doi.org/10.31149/ijie.v4i5.1837

المؤلفون: Bienvenu, Laurent, Downey, Rodney, Graham

المساهمون: Systèmes complexes, automates et pavages (ESCAPE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS), School of Mathematics, Statistics and Computer Science Wellington, Victoria University Melbourne, Rolf Niedermeier, Brigitte Vallée, ANR-15-CE40-0016,RaCAF,Dépasser les frontières de l'aléatoire et du calculable(2015)

المصدر: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03113211
35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Feb 2018, Caen, France. pp.15:1-15:13, ⟨10.4230/LIPIcs.STACS.2018.15⟩
https://stacs2018.sciencesconf.org/

مصطلحات موضوعية: Lowness for speed, Oracle computations, Turing degrees, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

جغرافية الموضوع: Caen, France

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1712.09710; lirmm-03113211; https://hal-lirmm.ccsd.cnrs.fr/lirmm-03113211; https://hal-lirmm.ccsd.cnrs.fr/lirmm-03113211/document; https://hal-lirmm.ccsd.cnrs.fr/lirmm-03113211/file/LIPIcs-STACS-2018-15.pdf; ARXIV: 1712.09710

الاتاحة: https://hal-lirmm.ccsd.cnrs.fr/lirmm-03113211
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03113211/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03113211/file/LIPIcs-STACS-2018-15.pdf
https://doi.org/10.4230/LIPIcs.STACS.2018.15

المؤلفون: Hemaspaandra, Edith, Hemaspaandra, Lane A., Spakowski, Holger, Watanabe, Osamu

المساهمون: Edith Hemaspaandra and Lane A. Hemaspaandra and Holger Spakowski and Osamu Watanabe

مصطلحات موضوعية: structural complexity theory, robustness of counting classes, the legitimate deck problem, PP-lowness, the Reconstruction Conjecture

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.51

الاتاحة: https://doi.org/10.4230/LIPIcs.MFCS.2018.51
https://nbn-resolving.org/urn:nbn:de:0030-drops-96330
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.51

المؤلفون: Masruhan, Masruhan

المصدر: Al-Mizan (e-Journal); Vol. 14 No. 1 (2018): Al-Mizan; 80-104 ; 2442-8256 ; 1907-0985

مصطلحات موضوعية: Lowness of Ufuk, Maghrib Prayer, Gread Mosque, Kerendahan Ufuk, Salat Maghrib, Masjid Agung

وصف الملف: application/pdf

Relation: https://journal.iaingorontalo.ac.id/index.php/am/article/view/731/721; https://journal.iaingorontalo.ac.id/index.php/am/article/view/731

الاتاحة: https://journal.iaingorontalo.ac.id/index.php/am/article/view/731

المؤلفون: Nies, André, author

الاتاحة: https://doi.org/10.1093/acprof:oso/9780199230761.001.0001

المؤلفون: Miller, Russell

المصدر: Beyond the Horizon of Computability

مصطلحات موضوعية: Computability, Hilbert’s Tenth Problem, Enumeration operators, Computable structure theory, Essential lowness, Article

URL الوصول: https://explore.openaire.eu/search/publication?articleId=pmc_________::120052a807546edb85731dd20ade4189
http://europepmc.org/articles/PMC7309498

المؤلفون: Melo, Fernanda Cardoso de

المساهمون: Nascimento, Bruno Dantas, Marques, Samantha Ribeiro Meyer-Pflug, Cortês, Osmar Mendes Paixão

المصدر: Biblioteca Digital de Teses e Dissertações da Uninove
Universidade Nove de Julho (UNINOVE)
instacron:UNINOVE

مصطلحات موضوعية: alternative methods, judicialization, conflitos, desjudicialização, conflicts, access to justice, DIREITO [CIENCIAS SOCIAIS APLICADAS], judiciário, judiciary, métodos alternativos, acesso à justiça, lowness

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=od______3056::96abe0b1d1e22d30303b6fb44b3109db
http://bibliotecatede.uninove.br/handle/tede/2507

المؤلفون: Rodney G. Downey, Laurent Bienvenu

المساهمون: Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), School of Mathematics, Statistics and Computer Science [Wellington], Victoria University [Melbourne], Systèmes complexes, automates et pavages (ESCAPE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Rolf Niedermeier, Brigitte Vallée, ANR-15-CE40-0016,RaCAF,Dépasser les frontières de l'aléatoire et du calculable(2015)

المصدر: Journal of Computer and System Sciences
Journal of Computer and System Sciences, Elsevier, 2020, 108, pp.49-63. ⟨10.1016/j.jcss.2019.08.007⟩
35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)
35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Feb 2018, Caen, France. pp.15:1-15:13, ⟨10.4230/LIPIcs.STACS.2018.15⟩

مصطلحات موضوعية: FOS: Computer and information sciences, Class (set theory), Statistics::Theory, TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Computational complexity theory, Computer Networks and Communications, Computer science, Computation, 03D15, 03D25, 03D32, 03D30, 03D80, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), Computer Science::Computational Complexity, 01 natural sciences, Oracle, Theoretical Computer Science, Turing machine, symbols.namesake, Lowness for speed, Computability theory, 020204 information systems, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, ComputingMilieux_MISCELLANEOUS, Discrete mathematics, 000 Computer science, knowledge, general works, Applied Mathematics, Turing degrees, TheoryofComputation_GENERAL, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], F.1.3, F.4.1, Mathematics - Logic, Oracle computations, Decidability, Computer Science - Computational Complexity, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], Computational Theory and Mathematics, 010201 computation theory & mathematics, Theory of computation, Computer Science, symbols, Logic (math.LO)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fc5a2a878ee9b771ceb324a7f5d6de30
https://hal.archives-ouvertes.fr/hal-02377935

المؤلفون: Keng Meng Ng, Rod Downey

المساهمون: School of Physical and Mathematical Sciences

المصدر: Annals of Pure and Applied Logic. 169:803-834

مصطلحات موضوعية: Mathematics [Science], Degree (graph theory), Logic, 010102 general mathematics, Contrast (statistics), Degree Splitting, 01 natural sciences, Combinatorics, Lowness, 0103 physical sciences, Join (sigma algebra), 010307 mathematical physics, 0101 mathematics, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a1ff336d3e767b5fc288c053762cf9e
https://doi.org/10.1016/j.apal.2018.04.004

المؤلفون: Nies, André, author

المصدر: Computability and Randomness, 2009, ill.

الاتاحة: https://doi.org/10.1093/acprof:oso/9780199230761.003.0008

المؤلفون: Figueira, S., Nies, A., Stephan, F.

المصدر: Ann. Pure Appl. Logic 2008;152(1-3):51-66

مصطلحات موضوعية: ω-r.e, K-triviality, Kolmogorov complexity, Lowness, Traceability

وصف الملف: application/pdf

Relation: http://hdl.handle.net/20.500.12110/paper_01680072_v152_n1-3_p51_Figueira; http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_01680072_v152_n1-3_p51_Figueira_oai

الاتاحة: https://hdl.handle.net/20.500.12110/paper_01680072_v152_n1-3_p51_Figueira
http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_01680072_v152_n1-3_p51_Figueira_oai

المؤلفون: Figueira, S., Nies, A., Stephan, F.

المصدر: Electron. Notes Theor. Comput. Sci. 2006;143(SPEC ISS):45-57

مصطلحات موضوعية: ω-r.e, K-triviality, Kolmogorov complexity, Lowness, Traceability, Combinatorial mathematics, Computational complexity, Number theory, Approximation theory

وصف الملف: application/pdf

Relation: http://hdl.handle.net/20.500.12110/paper_15710661_v143_nSPECISS_p45_Figueira; http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_15710661_v143_nSPECISS_p45_Figueira_oai

الاتاحة: https://hdl.handle.net/20.500.12110/paper_15710661_v143_nSPECISS_p45_Figueira
http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_15710661_v143_nSPECISS_p45_Figueira_oai

المؤلفون: Rod Downey

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.icm2006.org/proceedings/Vol_II/contents/ICM_Vol_2_01.pdf.

مصطلحات موضوعية: computability, degrees of unsolvability, prefix-free complexity, lowness, incompressibility, martingales, computably enumerable

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.4515; http://www.icm2006.org/proceedings/Vol_II/contents/ICM_Vol_2_01.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.4515
http://www.icm2006.org/proceedings/Vol_II/contents/ICM_Vol_2_01.pdf

المؤلفون: Bjørn Kjos-hanssen, Frank Stephan

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.geocities.com/bjoernkjoshanssen/research/KNS.pdf.

مصطلحات موضوعية: lowness, randomness, Schnorr randomness, Turing degrees, recursion theory, computability

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.9883; http://www.geocities.com/bjoernkjoshanssen/research/KNS.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.9883
http://www.geocities.com/bjoernkjoshanssen/research/KNS.pdf

المؤلفون: Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: ftp://ftp.cs.rochester.edu/pub/papers/theory/02.tr759nrev.Competing_Provers_Improved_Krp-Lptn_Collapse_Results.ps.gz

مصطلحات موضوعية: Structural complexity, competing provers, nonuniform complexity, symmetric alternation, Karp--Lipton Theorem, Yap's Theorem, Kamper--AFK Theorem, lowness

وصف الملف: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.2691

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.2691

المؤلفون: Miller, Tess

المصدر: Flutist Quarterly. Fall2016, Vol. 42 Issue 1, p70-71. 2p.

مصطلحات موضوعية: *FLUTE music

Reviews & Products: LABYRINTHS of Lowness (Music)

People: MONASH University Flute Ensemble (Performer)

المؤلفون: V. Arvind, Johannes Köbler

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://samy.informatik.hu-berlin.de/Institut/struktur/algorithmenII/Papers/zpp.ps.gz.

مصطلحات موضوعية: Lowness, self-reducible set, interactive proof system, probabilistic class, function class, program checker

وصف الملف: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.9754; http://samy.informatik.hu-berlin.de/Institut/struktur/algorithmenII/Papers/zpp.ps.gz

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.9754
http://samy.informatik.hu-berlin.de/Institut/struktur/algorithmenII/Papers/zpp.ps.gz

المؤلفون: Nies, André, author

المصدر: Computability and Randomness, 2009, ill.

الاتاحة: https://doi.org/10.1093/acprof:oso/9780199230761.003.0001

المؤلفون: Nies, André, author

المصدر: Computability and Randomness, 2009, ill.

الاتاحة: https://doi.org/10.1093/acprof:oso/9780199230761.003.0005

المؤلفون: Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan, Alan L. Selman

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.cs.uchicago.edu/~naik/papers/hnosb.ps.Z.

مصطلحات موضوعية: Key words. computational complexity, semi-decision algorithms, nonuniform complexity, lowness

وصف الملف: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.9147; http://www.cs.uchicago.edu/~naik/papers/hnosb.ps.Z

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.9147
http://www.cs.uchicago.edu/~naik/papers/hnosb.ps.Z