المؤلفون: Samuel R. Buss, Leszek Aleksander Kolodziejczyk

المصدر: Logical Methods in Computer Science, Vol Volume 10, Issue 2 (2014)

مصطلحات موضوعية: computer science - logic in computer science, mathematics - logic, Logic, BC1-199, Electronic computers. Computer science, QA75.5-76.95

وصف الملف: electronic resource

Relation: https://lmcs.episciences.org/852/pdf; https://doaj.org/toc/1860-5974

URL الوصول: https://doaj.org/article/ab98e794cdda4823bc92198013ee672e

المؤلفون: Samuel R. Buss, Jan Hoffmann, Jan Johannsen

المصدر: Logical Methods in Computer Science, Vol Volume 4, Issue 4 (2008)

مصطلحات موضوعية: computer science - logic in computer science, computer science - computational complexity, f.2.2, i.2.8, Logic, BC1-199, Electronic computers. Computer science, QA75.5-76.95

وصف الملف: electronic resource

Relation: https://lmcs.episciences.org/860/pdf; https://doaj.org/toc/1860-5974

URL الوصول: https://doaj.org/article/9860ff3ed37349baa9af6375e11ececc

المؤلفون: Artur Riazanov, Dmitry Sokolov, Dmitry Itsykson, Samuel R. Buss, Alexander Knop

المصدر: ACM Transactions on Computational Logic. 22:1-30

مصطلحات موضوعية: Discrete mathematics, Computational Mathematics, General Computer Science, Logic, Mathematical proof, Theoretical Computer Science, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::d3406175cdb55fc4db831856e953c5b0
https://doi.org/10.1145/3468855

المؤلفون: Antonio Morgado, Maria Luisa Bonet, Joao Marques-Silva, Samuel R. Buss, Alexey Ignatiev

المساهمون: Université polytechnique de Catalogne (UPC), University of California, Monash University [Melbourne], Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento em Lisboa (INESC-ID), Instituto Superior Técnico, Universidade Técnica de Lisboa (IST)-Instituto de Engenharia de Sistemas e Computadores (INESC), Argumentation, Décision, Raisonnement, Incertitude et Apprentissage (IRIT-ADRIA), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, FCTgrants Fault Locker (PTDC/CCI-COM/29300/2017), SAFETY (SFRH/BPD/120315/2016), SAMPLE (CEECIND/04549/2017), INFOCOS (PTDC/CCI-COM/32378/2017), Ministerio de Educación y Ciencia grant TIN2016-76573-C2-2-P (TASSAT3), Ministerio de Ciencia e Innovación grant PID2019-109137GB-C21(PROOFS), Simons Foundation grant 578919, ANR-19-P3IA-0004,ANITI,Artificial and Natural Intelligence Toulouse Institute(2019), European Project: H2020 - ICT38,COALA, University of California (UC), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)

المصدر: Artificial Intelligence
Artificial Intelligence, Elsevier, 2021, 300, pp.1-59. ⟨10.1016/j.artint.2021.103552⟩
Artificial Intelligence, 2021, 300, pp.1-59. ⟨10.1016/j.artint.2021.103552⟩

مصطلحات موضوعية: Linguistics and Language, Polynomial, Computer science, MathematicsofComputing_NUMERICALANALYSIS, 02 engineering and technology, Mathematical proof, 01 natural sciences, Maximum satisfiability, Language and Linguistics, Set (abstract data type), Artificial Intelligence, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], 0101 mathematics, Propositional proof systems, Discrete mathematics, Pigeonhole principle, 010102 general mathematics, Resolution (logic), 16. Peace & justice, Satisfiability, Maximum satisfiability problem, 020201 artificial intelligence & image processing, Clause learning, Resolution, Boolean satisfiability problem

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

المؤلفون: Samuel R. Buss, Arnold Beckmann

المصدر: Annals of Pure and Applied Logic. 170:1176-1187

مصطلحات موضوعية: TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Logic, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Computer Science::Logic in Computer Science, Calculus, Sequent calculus, Mathematical proof, Constant (mathematics), Proof construction, Mathematics

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

المؤلفون: Samuel R. Buss

المصدر: Outstanding Contributions to Logic ISBN: 9783030714291

مصطلحات موضوعية: Discrete mathematics, Mathematics::Logic, Proof complexity, Computer Science::Logic in Computer Science, Mathematics::History and Overview, Substitution (logic), Frege system, State (functional analysis), Computer Science::Computational Complexity, Mathematical proof, Propositional calculus, Integration by substitution, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::1826ee7f4610e8ad7298e88a78a900f3
https://doi.org/10.1007/978-3-030-71430-7_17

المؤلفون: Ramyaa Ramyaa, Samuel R. Buss

المصدر: Mathematical Logic Quarterly. 64:505-513

مصطلحات موضوعية: Pure mathematics, 010201 computation theory & mathematics, 010102 general mathematics, 0102 computer and information sciences, 0101 mathematics, Equivalence (formal languages), 01 natural sciences, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::0901420004fafaf4598abbe67849d20b
https://doi.org/10.1002/malq.201700034

المؤلفون: Samuel R. Buss, Maria Luisa Bonet, James Aisenberg

المساهمون: Universitat Politècnica de Catalunya. Departament de Ciències de la Computació

المصدر: Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

مصطلحات موضوعية: Computer Networks and Communications, TFNP, Applied Mathematics, NP search problems, Parity principle, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, PPAD, Theoretical Computer Science, Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat [Àrees temàtiques de la UPC], Combinatorics, Computational complexity, Computational Theory and Mathematics, 010201 computation theory & mathematics, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Search problem, Tucker lemma, PPA, Complexitat computacional, Mathematics

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

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dbd97991d685fcf890e257d594b476b2
https://hdl.handle.net/2117/177608

المؤلفون: Samuel R. Buss

المصدر: Archive for Mathematical Logic. 56:639-669

مصطلحات موضوعية: Discrete mathematics, 0209 industrial biotechnology, Proofs of Fermat's little theorem, Logic, Boolean circuit, 010102 general mathematics, 02 engineering and technology, Mathematical proof, 01 natural sciences, Combinatorics, Philosophy, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 020901 industrial engineering & automation, Closure (mathematics), Bounded function, 0101 mathematics, Special case, Representation (mathematics), Constant (mathematics), Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::3688ded99f569e63a51a2f770e3e1e7e
https://doi.org/10.1007/s00153-017-0560-9

المؤلفون: Arnold Beckmann, Samuel R. Buss

المصدر: ACM Transactions on Computational Logic. 18:1-19

مصطلحات موضوعية: Discrete mathematics, General Computer Science, Logic, Proof complexity, media_common.quotation_subject, 010102 general mathematics, 0102 computer and information sciences, Consistency (knowledge bases), Function (mathematics), Propositional calculus, Mathematical proof, 01 natural sciences, Oracle, Theoretical Computer Science, Computational Mathematics, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 010201 computation theory & mathematics, Contradiction, 0101 mathematics, Time complexity, media_common, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3db679cde88fa87145351c7226a2b3f
https://doi.org/10.1145/3060145