Computational Complexity of Theories of a Binary Predicate with a Small Number of Variables: Computational complexity of theories of a binary predicate with a small number of variables

Συγγραφείς: Rybakov, M.

Πηγή: Doklady Mathematics. 106:458-461

Θεματικοί όροι: Complexity of computation (including implicit computational complexity), Church's theorem, Trakhtenbrot's theorem, undecidability, 0102 computer and information sciences, 0101 mathematics, dyadic logic, 01 natural sciences, first-order logic

Περιγραφή αρχείου: application/xml

A Logarithmic Lower Bound for Oblivious RAM (for All Parameters): A logarithmic lower bound for oblivious RAM (for all parameters)

Συγγραφείς: Ilan Komargodski, Wei-Kai Lin

Πηγή: Lecture Notes in Computer Science ISBN: 9783030842581

Θεματικοί όροι: Complexity of computation (including implicit computational complexity), Data structures, Data encryption (aspects in computer science), cell-probe complexity, Cryptography, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), lower bound, 16. Peace & justice, oblivious RAM

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://link.springer.com/chapter/10.1007/978-3-030-84259-8_20
https://dblp.uni-trier.de/db/conf/crypto/crypto2021-4.html#KomargodskiL21

Computational Complexity of the Word Problem in Modal and Heyting Algebras with a Small Number of Generators: Computational complexity of the word problem in modal and Heyting algebras with a small number of generators

Συγγραφείς: Rybakov, M.

Πηγή: Russian Mathematics. 66:33-48

Θεματικοί όροι: word problem, Complexity of computation (including implicit computational complexity), finitely generated algebra, pseudo-Boolean algebra, Heyting algebra, 0102 computer and information sciences, 01 natural sciences, Other algebras related to logic, modal algebra, Descriptive complexity and finite models, Heyting algebras (lattice-theoretic aspects), Generalizations of Boolean algebras, 0101 mathematics, Modal logic (including the logic of norms)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7644547
https://doi.org/10.3103/s1066369x22050061

On the coprimeness relation from the viewpoint of monadic second-order logic

Συγγραφείς: Speranski, Stanislav O., Pakhomov, Fedor N.

Πηγή: Izvestiya: Mathematics. 86:1225-1239

Θεματικοί όροι: definability, weak arithmetics, Complexity of computation (including implicit computational complexity), coprimeness, monadic second-order logic, Interpolation, preservation, definability, Second- and higher-order arithmetic and fragments

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7733645
https://doi.org/10.4213/im9340e

Physical Computational Complexity and First-order Logic: Physical computational complexity and first-order logic

Συγγραφείς: Richard Whyman

Πηγή: Fundamenta Informaticae. 181:129-161

Θεματικοί όροι: Complexity of computation (including implicit computational complexity), computable analysis, Blum-Shub-Smale machines, 0102 computer and information sciences, 01 natural sciences, hypercomputation, Church-Turing thesis, Turing machines and related notions, Quantum computation, Complexity classes (hierarchies, relations among complexity classes, etc.), physical computation, atemporal computation, Computation over the reals, computable analysis, non-causal computation

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://dblp.uni-trier.de/db/journals/fuin/fuin181.html#Whyman21
https://content.iospress.com/articles/fundamenta-informaticae/fi2054

The Complexity of Decomposability of Computable Rings: The complexity of decomposability of computable rings

Συγγραφείς: Wu, Huishan

Πηγή: Notre Dame Journal of Formal Logic. 64

Θεματικοί όροι: Complexity of computation (including implicit computational complexity), block decomposable rings, decomposable rings, computable rings, Computable structure theory, computable model theory, Theory of numerations, effectively presented structures

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7690431
https://doi.org/10.1215/00294527-2023-0003

CONSISTENCY PROOF OF A FRAGMENT OF PV WITH SUBSTITUTION IN BOUNDED ARITHMETIC: Consistency proof of a fragment of PV with substitution in bounded arithmetic

Συγγραφείς: Yoriyuki Yamagata

Πηγή: The Journal of Symbolic Logic. 83:1063-1090

Θεματικοί όροι: FOS: Computer and information sciences, First-order arithmetic and fragments, Complexity of computation (including implicit computational complexity), Computer Science - Logic in Computer Science, computational complexity, consistency proof, bounded arithmetic, Mathematics - Logic, 0102 computer and information sciences, 01 natural sciences, Logic in Computer Science (cs.LO), 03F03, 03D15, FOS: Mathematics, F.4.1, 0101 mathematics, Logic (math.LO)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/1411.7087
http://arxiv.org/abs/1411.7087
https://zbmath.org/6966186
https://doi.org/10.1017/jsl.2018.14
https://arxiv.org/abs/1411.7087v6
http://ui.adsabs.harvard.edu/abs/2014arXiv1411.7087Y/abstract
https://arxiv.org/pdf/1411.7087v6
https://128.84.21.199/abs/1411.7087
https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/consistency-proof-of-a-fragment-of-pv-with-substitution-in-bounded-arithmetic/BC7F7D02C90A8E440B84FBC8AA9E2C4E
https://dblp.uni-trier.de/db/journals/jsyml/jsyml83.html#Yamagata18
http://dblp.uni-trier.de/db/journals/jsyml/jsyml83.html#Yamagata18

One Query Reducibilities Between Partial Information Classes: One query reducibilities between partial information classes

Συγγραφείς: Arfst Nickelsen, Sebastian Bab

Πηγή: Lecture Notes in Computer Science ISBN: 9783540228233

Θεματικοί όροι: Complexity of computation (including implicit computational complexity), cheatable language, Membership comparable, Easily countable, Formal languages and automata, 0102 computer and information sciences, partial information algorithm, 01 natural sciences, Theoretical Computer Science, p-selective, One qvery reduction cheatable, Partial information, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics, Computer Science(all)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://link.springer.com/chapter/10.1007%2F978-3-540-28629-5_30
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2004.html#BabN04
https://core.ac.uk/display/82604745
https://www.sciencedirect.com/science/article/pii/S0304397505003919
https://rd.springer.com/chapter/10.1007/978-3-540-28629-5_30

A Reducibility for the Dot-Depth Hierarchy: A reducibility for the dot-depth hierarchy

Συγγραφείς: Victor L. Selivanov, Klaus W. Wagner

Πηγή: Lecture Notes in Computer Science ISBN: 9783540228233

Θεματικοί όροι: Complexity of computation (including implicit computational complexity), Complete sets, 0102 computer and information sciences, 01 natural sciences, Hierarchies of computability and definability, Theoretical Computer Science, Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), Leaf languages, Dot-depth hierarchy, 0101 mathematics, Reducibility, Degree structure, Computer Science(all)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/2235842
https://doi.org/10.1016/j.tcs.2005.07.020
https://core.ac.uk/display/82049108
https://www.sciencedirect.com/science/article/pii/S0304397505004068
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2004.html#SelivanovW04
https://link.springer.com/chapter/10.1007/978-3-540-28629-5_61
https://rd.springer.com/chapter/10.1007/978-3-540-28629-5_61

Space complexity of random formulae in resolution

Συγγραφείς: BEN SASSON E., GALESI, NICOLA

Πηγή: Proceedings 16th Annual IEEE Conference on Computational Complexity. :42-51

Θεματικοί όροι: Complexity of proofs, Complexity of computation (including implicit computational complexity), space complexity of refuting unsatisfiable random formulas, treelike resolution refutations, 0102 computer and information sciences, lower bounds on the clause space, 01 natural sciences, Mechanization of proofs and logical operations, Random Formulas, space proof complexity, Reoslution, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), matching games on bipartite graphs, Graph theory (including graph drawing) in computer science, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Games involving graphs

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/1959946
https://doi.org/10.1002/rsa.10089
https://ieeexplore.ieee.org/document/933871/
https://dblp.uni-trier.de/db/conf/coco/coco2001.html#Ben-SassonG01
http://ieeexplore.ieee.org/document/933871/
https://hdl.handle.net/11573/133656
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000184211400005&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a
https://doi.org/10.1002/rsa.10089

Lower bounds and the hardness of counting properties

Συγγραφείς: Mayur Thakur, Lane A. Hemaspaandra

Πηγή: Foundations of Information Technology in the Era of Network and Mobile Computing ISBN: 9781475752755

Θεματικοί όροι: Complexity of computation (including implicit computational complexity), Counting properties, UP, Relativization, Rice's Theorem, Lower bounds, 0102 computer and information sciences, 01 natural sciences, NP, Theoretical Computer Science, Circuits, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Complexity classes (hierarchies, relations among complexity classes, etc.), Language properties, 0101 mathematics, Computer Science(all)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://link.springer.com/content/pdf/10.1007%2F978-0-387-35608-2_19.pdf
https://zbmath.org/2126103
https://doi.org/10.1016/j.tcs.2004.03.004
https://dl.acm.org/doi/10.1016/j.tcs.2004.03.004
https://dblp.uni-trier.de/db/journals/tcs/tcs326.html#HemaspaandraT04
https://core.ac.uk/display/81112005
https://www.sciencedirect.com/science/article/pii/S0304397504001458
https://dblp.uni-trier.de/db/conf/ifipTCS/ifipTCS2002.html#HemaspaandraT02
https://rd.springer.com/chapter/10.1007/978-0-387-35608-2_19
https://link.springer.com/chapter/10.1007/978-0-387-35608-2_19
https://urresearch.rochester.edu/institutionalPublicationPublicView.action?institutionalItemId=430&versionNumber=1
https://link.springer.com/10.1007/978-0-387-35608-2_19
http://core.ac.uk/display/24597290

Comparing Verboseness for Finite Automata and Turing Machines: Comparing verboseness for finite automata and Turing machines

Συγγραφείς: Till Tantau

Πηγή: Lecture Notes in Computer Science ISBN: 9783540432838

Θεματικοί όροι: Complexity of computation (including implicit computational complexity), Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), Formal languages and automata, verboseness, finite automata, Turing machines, 0102 computer and information sciences, Models of computation (Turing machines, etc.), 0101 mathematics, 01 natural sciences, complexity classes, regular languages

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/2130945
https://doi.org/10.1007/s00224-003-1108-4
https://dblp.uni-trier.de/db/journals/mst/mst37.html#Tantau04
https://link.springer.com/article/10.1007%2Fs00224-003-1108-4
http://www.tcs.uni-luebeck.de/downloads/mitarbeiter/tantau/Tantau2002a.pdf
https://link.springer.com/article/10.1007/s00224-003-1108-4
https://link.springer.com/10.1007/3-540-45841-7_38
https://rd.springer.com/chapter/10.1007/3-540-45841-7_38
https://dblp.uni-trier.de/db/conf/stacs/stacs2002.html#Tantau02

Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies: Relating automata-theoretic hierarchies to complexity-theoretic hierarchies

Συγγραφείς: Victor L. Selivanov

Πηγή: Lecture Notes in Computer Science ISBN: 9783540424871

Θεματικοί όροι: Complexity of computation (including implicit computational complexity), 4. Education, fine hierarchy, complexity theory, Formal languages and automata, 0102 computer and information sciences, 15. Life on land, Automata and formal grammars in connection with logical questions, 16. Peace & justice, automata theory, 01 natural sciences, Hierarchies of computability and definability, typed Boolean hierarchy, Complexity classes (hierarchies, relations among complexity classes, etc.), leaf-languages, Straubing hierarchy, Brzozowski hierarchy, 0101 mathematics, polynomial-time hierarchy

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://www.numdam.org/item/10.1051/ita:2002003.pdf
https://zbmath.org/1890826
https://doi.org/10.1051/ita:2002003
https://link.springer.com/chapter/10.1007/3-540-44669-9_31
https://dblp.uni-trier.de/db/conf/fct/fct2001.html#Selivanov01
https://rd.springer.com/chapter/10.1007/3-540-44669-9_31
http://www.rairo-ita.org/articles/ita/abs/2002/01/ita0212/ita0212.html
https://www.rairo-ita.org/articles/ita/abs/2002/01/ita0212/ita0212.html
https://dblp.uni-trier.de/db/journals/ita/ita36.html#Selivanov02
http://www.numdam.org/item/ITA_2002__36_1_29_0/
https://www.cambridge.org/core/journals/rairo-theoretical-informatics-and-applications/article/relating-automatatheoretic-hierarchies-to-complexitytheoretic-hierarchies/AB100737DAE66FDF79486A98207EC2F1

There Are No Sparse NPw-Hard Sets: There are no sparse NP\(_{w}\)-hard sets

Συγγραφείς: Dima Grigoriev, Felipe Cucker

Πηγή: Lecture Notes in Computer Science ISBN: 9783540424963

Θεματικοί όροι: Complexity of computation (including implicit computational complexity), 4. Education, structural complexity, Complexity classes (hierarchies, relations among complexity classes, etc.), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), real number computations, 0102 computer and information sciences, 0101 mathematics, 16. Peace & justice, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://epubs.siam.org/doi/pdf/10.1137/S0097539700379346
https://rd.springer.com/chapter/10.1007/3-540-44683-4_25
https://link.springer.com/chapter/10.1007/3-540-44683-4_25
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2001.html#CuckerG01
https://scholars.cityu.edu.hk/en/publications/there-are-no-sparse-npwhard-sets(840a4a17-dd38-4896-bcb6-fc79692ac8f5).html
https://epubs.siam.org/doi/abs/10.1137/S0097539700379346
https://locus.siam.org/doi/abs/10.1137/S0097539700379346
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp31.html#CuckerG01

Randomness is hard

Συγγραφείς: Buhrman, H.M., Torenvliet, L.

Πηγή: Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247). :249-260

Θεματικοί όροι: interactive proofs, Complexity of computation (including implicit computational complexity), CND complexity, Kolmogorov complexity, randomness, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), Merlin-Arthur, Algorithmic information theory (Kolmogorov complexity, etc.), complexity classes, Descriptive complexity and finite models, Complexity classes (hierarchies, relations among complexity classes, etc.), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), CD complexity, relativization, Arthur-Merlin

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://dare.uva.nl/personal/pure/en/publications/randomness-is-hard(e15bc823-88ae-4c84-b05d-5f59b1e7d7fc).html
https://hdl.handle.net/11245/1.153489
https://hdl.handle.net/11245/1.153487
https://dare.uva.nl/personal/pure/en/publications/randomness-is-hard(a1995f15-ca11-4396-9714-e75e62d1fa36).html
https://hdl.handle.net/11245/1.177596
https://doi.org/10.1137/S0097539799360148
https://dare.uva.nl/personal/pure/en/publications/randomness-is-hard(45e1b984-a1a1-4726-baed-7dcd13cb4da0).html
https://www.narcis.nl/publication/RecordID/oai%3Acwi.nl%3A1273
http://doi.ieeecomputersociety.org/10.1109/CCC.1998.694616
https://ieeexplore.ieee.org/document/694616/
https://dblp.uni-trier.de/db/conf/coco/coco1998.html#BuhrmanT98
https://epubs.siam.org/doi/pdf/10.1137/S0097539799360148
http://ieeexplore.ieee.org/document/694616/

Almost complete sets: Almost complete sets.

Συγγραφείς: Sebastiaan A. Terwijn, Wolfgang Merkle, Klaus Ambos-Spies, Jan Reimann

Πηγή: Lecture Notes in Computer Science ISBN: 9783540671411

Θεματικοί όροι: Completeness, almost completeness, Complexity of computation (including implicit computational complexity), many-one reductions, Weak completeness, Resource-bounded measure, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 02 engineering and technology, weak completeness, 1-tt-reductions, 01 natural sciences, Many-one reductions, Theoretical Computer Science, Resource-bounded reducibilities, resource-bounded measure, Almost completeness, 0202 electrical engineering, electronic engineering, information engineering, Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), length-increasing one-one reductions, resource-bounded reducibilities, Length-increasing one–one reductions, Computer Science(all)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/2056796
https://doi.org/10.1016/s0304-3975(03)00262-7
https://link.springer.com/content/pdf/10.1007%2F3-540-46541-3_35.pdf
https://dblp.uni-trier.de/db/conf/stacs/stacs2000.html#Ambos-SpiesMRT00
https://pennstate.pure.elsevier.com/en/publications/almost-complete-sets
https://core.ac.uk/display/24726842
https://link.springer.com/chapter/10.1007%2F3-540-46541-3_35
https://rd.springer.com/chapter/10.1007/3-540-46541-3_35
https://dblp.uni-trier.de/db/journals/tcs/tcs306.html#Ambos-SpiesMRT03
https://www.sciencedirect.com/science/article/pii/S0304397503002627
https://pennstate.pure.elsevier.com/en/publications/almost-complete-sets-2
https://math.uni-heidelberg.de/logic/merkle/final-versions/TCS-almcomp.pdf
https://doi.org/10.1016/S0304-3975(03)00262-7

The Global Power of Additional Queries to p-Random Oracles: The global power of additional queries to \(p\)-random oracles

Συγγραφείς: Wolfgang Merkle

Πηγή: Lecture Notes in Computer Science ISBN: 9783540677154

Θεματικοί όροι: Complexity of computation (including implicit computational complexity), 4. Education, random oracles, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, random sets, Algorithmic information theory (Kolmogorov complexity, etc.), bounded truth-table reducibility, 0202 electrical engineering, electronic engineering, information engineering, Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), effective measure, query complexity, resource-bounded reducibilities, effective reducibilities, separation of reducibilities, resource bounded measure

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://dblp.uni-trier.de/db/conf/icalp/icalp2000.html#Merkle00
https://link.springer.com/content/pdf/10.1007%2F3-540-45022-X_77.pdf
https://link.springer.com/chapter/10.1007/3-540-45022-X_77
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp31.html#Merkle01
https://rd.springer.com/chapter/10.1007/3-540-45022-X_77
https://locus.siam.org/doi/abs/10.1137/S0097539700366711
http://math.uni-heidelberg.de/logic/merkle/ps/SICOMP-global.pdf
https://epubs.siam.org/doi/pdf/10.1137/S0097539700366711
https://math.uni-heidelberg.de/logic/merkle/ps/SICOMP-global.pdf

Extending Downward Collapse from 1-versus-2 Queries tom-versus-m+ 1 Queries: Extending downward collapse from 1-versus-2 queries to \(m\)-versus-\(m + 1\) queries

Συγγραφείς: Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel

Πηγή: Lecture Notes in Computer Science ISBN: 9783540656913

Θεματικοί όροι: Boolean hierarchy, Complexity of computation (including implicit computational complexity), 4. Education, no-search easy-hard technique, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), computational complexity theory, 0102 computer and information sciences, 02 engineering and technology, downward translation of equality, 16. Peace & justice, 01 natural sciences, downward collapse, upward separation, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), polynomial hierarchy

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/2205896
https://doi.org/10.1137/s0097539701391002
https://link.springer.com/chapter/10.1007/3-540-49116-3_25
http://dblp.uni-trier.de/db/conf/stacs/stacs99.html#HemaspaandraHH99
https://doi.org/10.1007/3-540-49116-3_25
https://link.springer.com/content/pdf/10.1007%2F3-540-49116-3_25.pdf
https://dblp.uni-trier.de/db/conf/stacs/stacs99.html#HemaspaandraHH99
https://rd.springer.com/chapter/10.1007/3-540-49116-3_25
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp34.html#HemaspaandraHH05
https://epubs.siam.org/doi/10.1137/S0097539701391002
https://doi.org/10.1137/S0097539701391002

Restrictive acceptance suffices for equivalence problems

Συγγραφείς: Lane A. Hemaspaandra, Jörg Rothe, Bernd Borchert

Πηγή: Lecture Notes in Computer Science ISBN: 9783540664123

Θεματικοί όροι: FOS: Computer and information sciences, Complexity of computation (including implicit computational complexity), Computer Science - Computational Complexity, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 02 engineering and technology, NP problem, Computational Complexity (cs.CC), F.1.3, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/cs/9907041v1.pdf
https://www.cambridge.org/core/services/aop-cambridge-core/content/view/4B2DAA55C4F03108BA235D48E4706BA6/S146115700000022Xa.pdf/div-class-title-restrictive-acceptance-suffices-for-equivalence-problems-div.pdf
http://arxiv.org/abs/cs/9907041
https://dblp.uni-trier.de/db/conf/fct/fct99.html#BorchertHR99
http://core.ac.uk/display/23077965
http://ui.adsabs.harvard.edu/abs/1999cs........7041B/abstract
https://rd.springer.com/chapter/10.1007/3-540-48321-7_9
https://arxiv.org/abs/cs/9907041
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.342.4455&rep=rep1&type=pdf

Computationally-Sound Proofs: Computationally sound proofs

Συγγραφείς: Micali, S.

Πηγή: Logic Colloquium '95 ISBN: 9781107167902
Lecture Notes in Logic ISBN: 9783540639947
Johann A. Makowsky, Elena V. Ravve, eds., Logic Colloquium '95: Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, held in Haifa, Israel, August 9-18, 1995 (Berlin: Springer-Verlag, 1998), 214-268

Θεματικοί όροι: interactive proofs, Complexity of computation (including implicit computational complexity), Complexity classes (hierarchies, relations among complexity classes, etc.), random oracles, Merkle trees, 0102 computer and information sciences, probabilistically checkable proofs, 01 natural sciences

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://people.csail.mit.edu/silvio/Selected%20Scientific%20Papers/Proof%20Systems/Computationally_Sound_Proofs.pdf
https://zbmath.org/1519295
https://doi.org/10.1137/s0097539795284959
https://projecteuclid.org/download/pdf_1/euclid.lnl/1235415908
https://epubs.siam.org/doi/pdf/10.1137/S0097539795284959
https://dl.acm.org/doi/abs/10.1137/S0097539795284959
https://projecteuclid.org/ebooks/lecture-notes-in-logic/Logic%20Colloquium%20'95:%20Proceedings%20of%20the%20Annual%20European%20Summer%20Meeting%20of%20the%20Association%20of%20Symbolic%20Logic
%20held%20in%20Haifa
%20Israel
%20August%209-18
%201995/chapter/Computationally-Sound%20Proofs/lnl/1235415908
https://people.csail.mit.edu/silvio/Selected%20Scientific%20Papers/Proof%20Systems/Computationally_Sound_Proofs.pdf
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp30.html#Micali00
http://projecteuclid.org/euclid.lnl/1235415908