المؤلفون: Austrin, Per, 1981, Manokaran, Rajsekar, Wenner, Cenny

المصدر: Theory of Computing. 11:257-283

مصطلحات موضوعية: Acyclic subgraph, APPROX, Approximation, Approximation resistance, Betweenness, Constraint satisfaction, CSPs, Feedback arc set, Hypercontractivity, NP-completeness, Orderings, PCP, Probabilistically checkable proofs, Hardness, NP-hard, Feedback arc sets, Probabilistically checkable proof, Constraint satisfaction problems

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-314134
https://doi.org/10.4086/toc.2015.v011a010

المؤلفون: Hang Su, David J. Wu, Yuval Ishai

المصدر: CCS

مصطلحات موضوعية: Soundness, Discrete mathematics, Reduction (recursion theory), business.industry, Computer science, 020206 networking & telecommunications, 0102 computer and information sciences, 02 engineering and technology, Extension (predicate logic), Gas meter prover, Encryption, Mathematical proof, 01 natural sciences, Quadratic equation, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, business, Probabilistically checkable proof

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

المؤلفون: Aviad Rubinstein, Virginia Vassilevska Williams

المصدر: ACM SIGACT News. 50:57-76

مصطلحات موضوعية: Thesaurus (information retrieval), Multidisciplinary, Perspective (geometry), Theoretical computer science, 010201 computation theory & mathematics, Computer science, 010102 general mathematics, Approximation algorithm, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Probabilistically checkable proof

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

المؤلفون: Klaus Meer, Martijn Baartse

المصدر: Journal of Complexity. 40:34-77

مصطلحات موضوعية: Statistics and Probability, PCP theorem, Discrete mathematics, Numerical Analysis, Control and Optimization, Algebra and Number Theory, Degree (graph theory), Applied Mathematics, General Mathematics, 010103 numerical & computational mathematics, 0102 computer and information sciences, Computer Science::Computational Complexity, 01 natural sciences, Combinatorics, 010201 computation theory & mathematics, Order (group theory), MAX-3SAT, 0101 mathematics, Algebraic number, Probabilistically checkable proof, Real number, Mathematics, Analytic proof

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::b5bd7e33f4e9a0474d4e0e33533cb845
https://doi.org/10.1016/j.jco.2016.11.006

المؤلفون: Subhash Khot, Rishi Saket

المصدر: SIAM Journal on Computing. 46:235-271

مصطلحات موضوعية: Discrete mathematics, Hypergraph, General Computer Science, Degree (graph theory), General Mathematics, Short Code, Computer Science::Computational Complexity, Binary logarithm, Omega, Combinatorics, Probabilistically checkable proof, computer, Mathematics, computer.programming_language

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::bb8be3cc4cd212e8b63e64fbd0f0ce2c
https://doi.org/10.1137/15100240x

المؤلفون: Vivek Nigam, Elaine Pimentel, João Carlos Neto

المصدر: LSFA

مصطلحات موضوعية: Discrete mathematics, General Computer Science, Proof complexity, Proof by contradiction, 010102 general mathematics, Combinatorial proof, 0102 computer and information sciences, 01 natural sciences, Theoretical Computer Science, Intuitionistic logic, 010201 computation theory & mathematics, Proof theory, Identity of proofs, Direct proof, Structural proof theory, 0101 mathematics, Proof Systems, Probabilistically checkable proof, Focusing, Mathematics, Analytic proof, Computer Science(all)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::744c0aa2261d3f7cf5a314cf3b82baf8

المؤلفون: Zhenbin Yan, Yi Deng

المصدر: Science China Information Sciences. 62

مصطلحات موضوعية: Theoretical computer science, General Computer Science, Computational complexity theory, Computer science, Hash function, 020207 software engineering, 02 engineering and technology, One-way function, Cryptographic protocol, 0202 electrical engineering, electronic engineering, information engineering, Key (cryptography), Zero-knowledge proof, State (computer science), Probabilistically checkable proof

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::dbe27325cd2a76207b5a929bc4a2df3e
https://doi.org/10.1007/s11432-018-9627-x

المؤلفون: Henry Corrigan-Gibbs, Dan Boneh, Niv Gilboa, Yuval Ishai, Elette Boyle

المصدر: Advances in Cryptology – CRYPTO 2019-39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part III
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2019
Advances in Cryptology – CRYPTO 2019 ISBN: 9783030269531
CRYPTO (3)

مصطلحات موضوعية: Theoretical computer science, Computer science, Small number, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 010201 computation theory & mathematics, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Zero-knowledge proof, Probabilistically checkable proof, Computer Science::Databases

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71270a8bba7e1dcc5e77a5999b941295

المؤلفون: Ron D. Rothblum, Tom Gur

المصدر: ITCS

مصطلحات موضوعية: Statement (computer science), Discrete mathematics, Property testing, 0209 industrial biotechnology, Theoretical computer science, Sublinear function, Property (programming), General Mathematics, Multiplicative function, Interactive proof system, 0102 computer and information sciences, 02 engineering and technology, Mathematical proof, 01 natural sciences, Theoretical Computer Science, QA76, Computational Mathematics, 020901 industrial engineering & automation, Computational Theory and Mathematics, 010201 computation theory & mathematics, Probabilistically checkable proof, Mathematics

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

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28e67ab61948086ab437da41cd61e74c
http://wrap.warwick.ac.uk/113748/1/WRAP-non-interactive-proofs-proximity-Gur-2018.pdf

المؤلفون: Or Meir

المصدر: IEEE Conference on Computational Complexity

مصطلحات موضوعية: PCP theorem, Discrete mathematics, 0209 industrial biotechnology, Polynomial, Degree (graph theory), General Mathematics, 0102 computer and information sciences, 02 engineering and technology, Computer Science::Computational Complexity, Binary logarithm, Mathematical proof, 01 natural sciences, Theoretical Computer Science, Combinatorics, Computational Mathematics, 020901 industrial engineering & automation, Computational Theory and Mathematics, 010201 computation theory & mathematics, Simple (abstract algebra), MAX-3SAT, Multiplication, Algebraic number, Probabilistically checkable proof, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bef2adb947384036ddd9f7719894f712
https://doi.org/10.1007/s00037-015-0111-x

المؤلفون: Jukka Suomela, Mika Göös

المصدر: Theory of Computing. 12:1-33

مصطلحات موضوعية: PCP theorem, Discrete mathematics, NEXPTIME, Proof complexity, 0102 computer and information sciences, 02 engineering and technology, Mathematical proof, 01 natural sciences, Theoretical Computer Science, Nondeterministic algorithm, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computational Theory and Mathematics, 010201 computation theory & mathematics, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, 0202 electrical engineering, electronic engineering, information engineering, Bipartite graph, 020201 artificial intelligence & image processing, Graph property, Probabilistically checkable proof, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::c9847ab82e9f03b2734d488dcb390a45
https://doi.org/10.4086/toc.2016.v012a019

المؤلفون: Shinnosuke Seki, Ming-Yang Kao, Aleck Johnsen

المصدر: Journal of Combinatorial Optimization. 33:496-529

مصطلحات موضوعية: Discrete mathematics, Control and Optimization, Applied Mathematics, 0102 computer and information sciences, 02 engineering and technology, 021001 nanoscience & nanotechnology, 01 natural sciences, Computer Science Applications, Combinatorics, Set (abstract data type), Computational Theory and Mathematics, 010201 computation theory & mathematics, visual_art, Theory of computation, visual_art.visual_art_medium, Discrete Mathematics and Combinatorics, Tile, 0210 nano-technology, Probabilistically checkable proof, Mathematics, Integer (computer science)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::069c072035e3b541151a64fe2f49f9d7
https://doi.org/10.1007/s10878-015-9975-6

المؤلفون: Guy N. Rothblum, Yael Tauman Kalai, Shafi Goldwasser

المصدر: STOC

مصطلحات موضوعية: Discrete mathematics, Theoretical computer science, Correctness, Computer science, Boolean circuit, Interactive proof system, Gas meter prover, Mathematical proof, Combinatorics, Artificial Intelligence, Hardware and Architecture, Control and Systems Engineering, Communication complexity, Probabilistically checkable proof, Time complexity, Software, Verifiable computing, Information Systems

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

المؤلفون: Karol Pąk

المصدر: Journal of Automated Reasoning. 55:295-306

مصطلحات موضوعية: Natural deduction, Computer science, Programming language, Proof complexity, business.industry, Proof assistant, Mizar system, computer.software_genre, Mathematical proof, Legibility, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computational Theory and Mathematics, Artificial Intelligence, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Automated proof checking, ComputingMethodologies_DOCUMENTANDTEXTPROCESSING, Artificial intelligence, business, computer, Probabilistically checkable proof, Software

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b80abf83429d5a3d6a997bf7f2c1f64c
https://doi.org/10.1007/s10817-015-9337-1

المؤلفون: Subhash Khot, Nisheeth K. Vishnoi

المصدر: Journal of the ACM. 62:1-39

مصطلحات موضوعية: Discrete mathematics, Conjecture, Reduction (recursion theory), Unique games conjecture, Hardness of approximation, Upper and lower bounds, Combinatorics, Artificial Intelligence, Hardware and Architecture, Control and Systems Engineering, Metric (mathematics), Embedding, Probabilistically checkable proof, Software, Information Systems, Mathematics

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

المؤلفون: Deborah L. McGuinness, Li Ding, Cynthia Chang, Paulo Pinheiro da Silva, Geoff Sutcliffe

المصدر: EPiC Series in Computing.

مصطلحات موضوعية: Discrete mathematics, Automated theorem proving, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Position (vector), TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Automated proof checking, Calculus, Order (group theory), Mathematical proof, Probabilistically checkable proof, Measure (mathematics), Mathematics, Ranking (information retrieval)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::f2652e085d60932ed880e821b8656988
https://doi.org/10.29007/kwk9

المؤلفون: Susumu Kiyoshima

المصدر: Theory of Cryptography ISBN: 9783030038069
TCC (1)

مصطلحات موضوعية: TheoryofComputation_MISCELLANEOUS, Soundness, Discrete mathematics, 0209 industrial biotechnology, Linear function (calculus), Distribution (number theory), Computation, 0102 computer and information sciences, 02 engineering and technology, Computer Science::Computational Complexity, Gas meter prover, 01 natural sciences, Oracle, Set (abstract data type), Computer Science::Graphics, 020901 industrial engineering & automation, 010201 computation theory & mathematics, Probabilistically checkable proof, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::ffe45ab786e212771c9a141c6aec3709
https://doi.org/10.1007/978-3-030-03807-6_3

المؤلفون: Sergei Artemov, Artëm Chuprina

مصطلحات موضوعية: Discrete mathematics, Theoretical computer science, Linear temporal logic, Proof complexity, Second-order logic, Multimodal logic, Dynamic logic (modal logic), Intermediate logic, Descriptive complexity theory, Probabilistically checkable proof, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::881d5b7fb0d9b74f6f6198cd8978f643
https://doi.org/10.1201/9780203748671-1

المؤلفون: Emmanouil Marakakis, Nikos Papadakis, Haridimos Kondylakis

المصدر: International Journal of Knowledge-based and Intelligent Engineering Systems. 18:143-156

مصطلحات موضوعية: Correctness, Theoretical computer science, Proof complexity, Computer science, Proof assistant, Proof of knowledge, Interactive proof system, Computer-assisted proof, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Artificial Intelligence, Control and Systems Engineering, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Automated proof checking, Probabilistically checkable proof, Software

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::49a8c2836387830758c0332e7f2133fe
https://doi.org/10.3233/kes-140294

المؤلفون: Moritz Müller, Albert Atserias

المساهمون: Universitat Politècnica de Catalunya. Departament de Ciències de la Computació, Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals, Centre de Recerca Matemàtica

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

مصطلحات موضوعية: Pure mathematics, Logic, Matemàtica constructiva, Depth frege proofs, 510 - Consideracions fonamentals i generals de les matemàtiques, Size, Bounded arithmetic, Computer Science::Logic in Computer Science, Hardware_ARITHMETICANDLOGICSTRUCTURES, Algebra over a field, Complexity gap, Complexitat computacional, Probabilistically checkable proof, Propositional proof systems, Mathematics, Discrete mathematics, Forcing (recursion theory), Proof complexity, Pigeonhole principle, Proposició (Lògica), Resolution (logic), Computational complexity, Philosophy, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Informàtica::Informàtica teòrica [Àrees temàtiques de la UPC], Matemàtiques i estadística::Anàlisi matemàtica [Àrees temàtiques de la UPC], Forcing, Resolution

وصف الملف: application/pdf; 320490 bytes

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4f27db95ae9cd59535bb63f82f035e1
https://doi.org/10.1007/s00153-014-0398-3