The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for pcp with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1978-1996 (15) 1997-1999 (18) 2000-2001 (17) 2002-2003 (17) 2004-2005 (27) 2006 (15) 2007 (21) 2008 (22) 2009 (21) 2010-2012 (17) 2013-2014 (16) 2015-2016 (18) 2017-2019 (21) 2020-2022 (17) 2023-2024 (8)
Publication types (Num. hits)
article(114) incollection(1) inproceedings(154) phdthesis(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 171 occurrences of 121 keywords

Results
Found 270 publication records. Showing 270 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
150Björn B. Brandenburg, James H. Anderson A Comparison of the M-PCP, D-PCP, and FMLPon LITMUSRT. Search on Bibsonomy OPODIS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
137Irit Dinur The PCP theorem by gap amplification. Search on Bibsonomy J. ACM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Gap amplification, PCP
129Venkatesan Guruswami, Daniel Lewin 0001, Madhu Sudan 0001, Luca Trevisan A Tight Characterization of NP with 3 Query PCPs. Search on Bibsonomy FOCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Probabilistically Checkable Proofs (PCP), Proof composition, Two-prover one-round proof systems, Adaptive and non-adaptive verifiers, Completeness and soundness, Complexity Theory, Query complexity
116Richard J. Lorentz Creating Difficult Instances of the Post Correspondence Problem. Search on Bibsonomy Computers and Games The full citation details ... 2000 DBLP  DOI  BibTeX  RDF transposition table, hash table, PCP, Post Correspondence Problem, single-agent search
115Irit Dinur, Omer Reingold Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem. Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
104Björn B. Brandenburg, James H. Anderson An Implementation of the PCP, SRP, D-PCP, M-PCP, and FMLP Real-Time Synchronization Protocols in LITMUSRT. Search on Bibsonomy RTCSA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
102Burak Kantarci, Mehmet Tahir Sandikkaya, Aysegül Gençata, Sema F. Oktug Prudent Creditization Polling (PCP): A Novel Adaptive Polling Service for an EPON. Search on Bibsonomy ONDM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Optical Access Network, Passive Optical Network, IPACT, Multipoint Control Protocol, EPON
89Russell Impagliazzo, Valentine Kabanets, Avi Wigderson New direct-product testers and 2-query PCPs. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF testing, PCP, parallel repetition, direct products
84Irit Dinur The PCP theorem by gap amplification. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF gap amplification, PCP
75Dana Moshkovitz, Ran Raz Two Query PCP with Sub-Constant Error. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
75Jonas Holmerin, Subhash Khot A new PCP outer verifier with applications to homogeneous linear equations and max-bisection. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF max-bisection, hardness of approximation, linear equations, PCPs
67Jonathan Bentwich The duality principle: irreducibility of sub-threshold psychophysical computation to neuronal brain activation. Search on Bibsonomy Synth. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Materialistic reductionism, Duality principle, Body-mind, Binding problem, Computation, Psychophysics, Neuroscience
67Oded Goldreich 0001, Madhu Sudan 0001 Locally testable codes and PCPs of almost-linear length. Search on Bibsonomy J. ACM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF error-correcting codes, derandomization, probabilistically checkable proofs, Proof verification
67Oded Goldreich 0001, Madhu Sudan 0001 Locally Testable Codes and PCPs of Almost-Linear Length. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
67Ling Zhao Tackling Post's Correspondence Problem. Search on Bibsonomy Computers and Games The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
64Karsten Krogh-Jespersen, Margaret Czerw, Mira Kanzelberger, Alan S. Goldman DFT/ECP Study of C-H Activation by (PCP)Ir and (PCP)Ir(H)2 (PCP = 3-1, 3-C6H3(CH2PR2)2). Enthalpies and Free Energies of Associative and Dissociative Pathways. Search on Bibsonomy J. Chem. Inf. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
63Eli Ben-Sasson, Oded Goldreich 0001, Prahladh Harsha, Madhu Sudan 0001, Salil P. Vadhan Robust pcps of proximity, shorter pcps and applications to coding. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF property testing, probabilistically checkable proofs, PCP, locally decodable codes, locally testable codes
63Venkatesan Guruswami, Sanjeev Khanna On the Hardness of 4-Coloring a 3-Colorable Graph. Search on Bibsonomy CCC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Graph Coloring, Hardness of approximation, PCP
61Subhash Khot, Rishi Saket A 3-Query Non-Adaptive PCP with Perfect Completeness. Search on Bibsonomy CCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
57Johan Håstad, Avi Wigderson Simple Analysis of Graph Tests for Linearity and PCP. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF graph test, pseudorandomness, PCP, Linearity testing, iterated test
56Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev 0001 A new multilayered PCP and the hardness of hypergraph vertex cover. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF hypergraph vertex cover, long code, multilayered PCP, hardness of approximation
54Xianbin Wang 0001, Yiyan Wu 0001, Hsiao-Chun Wu A New Adaptive OFDM System with Precoded Cyclic Prefix for Cognitive Radio. Search on Bibsonomy ICC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
54Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky Efficient Arguments without Short PCPs. Search on Bibsonomy CCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
54Lars Engebretsen, Jonas Holmerin Three-Query PCPs with Perfect Completeness over non-Boolean Domains. Search on Bibsonomy CCC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
49Venkatesan Guruswami Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Set splitting, Hardness of approximations, PCP, Gadgets
48Tianyan Deng, Daoyun Xu NP-Completeness of (k-SAT, r-UNk-SAT) and (LSAT>=k, r-UNLSAT>=k). Search on Bibsonomy FAW The full citation details ... 2008 DBLP  DOI  BibTeX  RDF PCP theorem, linear CNF formula, LSAT, minimal unsatisfiable(MU) formula, NP-completeness, reduction
48Yael Tauman Kalai, Ran Raz Interactive PCP. Search on Bibsonomy ICALP (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
48Klaus Meer Transparent Long Proofs: A First PCP Theorem for NPR. Search on Bibsonomy Found. Comput. Math. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Real number complexity, Verifiers, Probabilistically checkable proofs
48Vesa Halava, Mika Hirvensalo, Ronald de Wolf Decidability and Undecidability of Marked PCP. Search on Bibsonomy STACS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
44Or Meir Combinatorial PCPs with Efficient Verifiers. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF PCPP, PCP of Proximity, super-fast, PCP
40Mohamed Hefeeda, Hossein Ahmadi 0001 A Probabilistic Coverage Protocol for Wireless Sensor Networks. Search on Bibsonomy ICNP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
40César Sánchez 0001, Henny B. Sipma, Christopher D. Gill, Zohar Manna Distributed Priority Inheritance for Real-Time and Embedded Systems. Search on Bibsonomy OPODIS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
40Lars Engebretsen, Jonas Holmerin More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP. Search on Bibsonomy STACS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
40Klaus Meer On Some Relations Between Approximation Problems and PCPs over the Real Numbers. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
40Tei-Wei Kuo, Yuan-Ting Kao, Chin-Fu Kuo Two-Version Based Concurrency Control and Recovery in Real-Time Client/Server Databases. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2003 DBLP  DOI  BibTeX  RDF client/server databases, write through procedure, concurrency control, recovery, logging, Real-time database, read-only transactions
40Jonas Holmerin Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
40Joo-Yong Kim, Sang Hyuk Son, Kern Koh The Ceiling Adjustment Scheme for Improving the Concurrency of Real-Time Systems with Mixed Workloads. Search on Bibsonomy COMPSAC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
40Alexandru Mateescu, Arto Salomaa Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes. Search on Bibsonomy MFCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
36Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani The detectability lemma and quantum gap amplification. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF QMA, detectability lemma, gap amplification, local hamiltonians, quantum computation, PCP
36Eli Ben-Sasson, Madhu Sudan 0001 Simple PCPs with poly-log rate and query complexity. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF PCPP, probabilistically checkable proofs, PCP, locally testable codes
35Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor The Power of Unentanglement. Search on Bibsonomy CCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF QMA, 3SAT, PCP Theorem, quantum computing, additivity, entanglement
35Jin-yi Cai, Hong Zhu 0004 Progress in Computational Complexity Theory. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF computational complexity theory, PCP theorem, logspace complexity, Reingold's theorem, GAP problem, complexity of lattice problems, worst-case to average-case reductions, extractors, pseudorandomness, inapproximability, primality testing, theoretical computer science, holographic algorithms
35 Parallel Coordinates Plot (PCP). Search on Bibsonomy Encyclopedia of Database Systems The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
35Ran Raz Quantum Information and the PCP Theorem. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Quantum interactive proofs, Quantum advice, Quantum computation, Probabilistically checkable proofs, Quantum information, Low degree test
35Hari Balakrishnan, Nikolaus Correll, Jakob Eriksson, Sejoon Lim, Samuel Madden 0001, Daniela Rus PCP: the personal commute portal. Search on Bibsonomy SenSys The full citation details ... 2008 DBLP  DOI  BibTeX  RDF sensor network, mobility, gps, navigation, application, path planning, data visualization, transportation, traffic
35Georgia M. Kapitsaki, Iakovos S. Venieris PCP: privacy-aware context profile towards context-aware application development. Search on Bibsonomy iiWAS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF privacy, context-awareness
35Ran Raz Quantum Information and the PCP Theorem. Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
35Klaus Meer Transparent Long Proofs: A First PCP Theorem for NPR. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
35Giuseppe Bianchi 0001, Flaminio Borgonovo, Antonio Capone, Luigi Fratta, Chiara Petrioli PCP-DV: An End-to-End Admission Control Mechanism for IP Telephony. Search on Bibsonomy IWDC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
35Vesa Halava, Tero Harju, Mika Hirvensalo Generalized PCP Is Decidable for Marked Morphisms. Search on Bibsonomy FCT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
35Volker Heun, Wolfgang Merkle, Ulrich Weigand Proving the PCP-Theorem. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
35Luca Trevisan Positive Linear Programming, Parallel Approximation and PCP's. Search on Bibsonomy ESA The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
27Yael Tauman Kalai, Ran Raz Probabilistically Checkable Arguments. Search on Bibsonomy CRYPTO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Irit Dinur PCPs with small soundness error. Search on Bibsonomy SIGACT News The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Olivier Dugeon, Enzo Mingozzi, Giovanni Stea, Luca Bisti Provisioning QoS in inter-domain traffic engineering. Search on Bibsonomy Ann. des Télécommunications The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Path computation element, EQ-link, Traffic engineering, DiffServ, Multi protocol label switching
27Li Yan, Sunwoo Park, Shahab Sheikh-Bahaei, Glen E. P. Ropella, C. Anthony Hunt Predicting hepatic disposition properties of cationic drugs using a physiologically based, agent-oriented In Silico Liver. Search on Bibsonomy SpringSim The full citation details ... 2008 DBLP  DOI  BibTeX  RDF drug disposition, hepatic, mechanistic, physiologically-based, prediction, systems biology, agent oriented
27Tianyan Deng, Daoyun Xu Hardness of Approximation Algorithms on k-SAT and (k, s)-SAT Problems. Search on Bibsonomy ICYCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Or Meir Combinatorial construction of locally testable codes. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF pcps of proximity, probabilistically checkable proofs, locally testable codes
27Vesa Halava, Tero Harju, Juhani Karhumäki The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Jay Walter Larson, Boyana Norris Component Specification for Parallel Coupling Infrastructure. Search on Bibsonomy ICCSA (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Dana Moshkovitz, Ran Raz Sub-constant error low degree test of almost-linear size. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF plane vs. point test, probabilistically checkable proofs, locally testable codes, low degree testing
27Philippe Marchand, Purnendu Sinha A Hardware Accelerator for Controlling Access to Multiple-Unit Resources in Safety/Time-Critical Systems. Search on Bibsonomy SAMOS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
27Subhash Khot, Nisheeth K. Vishnoi The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1. Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
27Paul Bell, Igor Potapov On the Membership of Invertible Diagonal Matrices. Search on Bibsonomy Developments in Language Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
27Subhash Khot Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique. Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Subhash Khot Hardness Results for Coloring 3 -Colorable 3 -Uniform Hypergraphs. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
27Luca Trevisan Non-approximability results for optimization problems on bounded degree instances. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
27Irit Dinur Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard. Search on Bibsonomy CIAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
27Venkatesan Guruswami Inapproximability results for set splitting and satisfiability problems with no mixed clauses. Search on Bibsonomy APPROX The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
27Liming Cai, David W. Juedes, Iyad A. Kanj The Inapproximability of Non NP-hard Optimization Problems. Search on Bibsonomy ISAAC The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
27Marjo Lipponen Post Correspondence Problem: Words Possible as Primitive Solutions. Search on Bibsonomy ICALP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
22Irit Dinur, Or Meir Derandomized Parallel Repetition of Structured PCPs. Search on Bibsonomy CCC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Low error, Direct Product Test, Derandomized Parallel Repetition, PCP, Direct Product, de-Bruijn
22Irit Dinur, Prahladh Harsha Composition of Low-Error 2-Query PCPs Using Decodable PCPs. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF locally decodable, low soundness error, composition, PCP
22Ryan O'Donnell, Yi Wu 0002 Conditional hardness for satisfiable 3-CSPs. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF khot's, satisfiable 3-CSPs, hardness of approximation, PCP
22Victor Chen A Hypergraph Dictatorship Test with Perfect Completeness. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Gowers norm, Property testing, Fourier analysis, PCP
22Jim Ras, Albert M. K. Cheng Real-time synchronization on distributed architecture with Ada-2005. Search on Bibsonomy SIGAda The full citation details ... 2008 DBLP  DOI  BibTeX  RDF dpcp, dsrp, edf, ada, pcp, rms, srp
22Tei-Wei Kuo, Ching-Hui Li A Fixed-Priority-Driven Open Environment for Real-Time Applications. Search on Bibsonomy RTSS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Resource Synchronization, Real-Time Systems, EDF, PCP, Generalized Processor Sharing, Open Environment, RM, SRP, Sporadic Server
21Boaz Barak, Oded Goldreich 0001 Universal Arguments and their Applications. Search on Bibsonomy CCC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Probabilistic proof systems, computationally-sound proof systems, zero-knowledge proof systems, probabilistic checkable proofs (PCP), collision-free hashing, witness indistinguishable proof systems, error-correcting codes, proofs of knowledge
21Venkatesan Guruswami, Johan Håstad, Madhu Sudan 0001 Hardness of Approximate Hypergraph Coloring. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF approximate hypergraph coloring, covering complexity, probabilistic verifier, PCP verifier, 2-colorable 4-uniform hypergraph, hardness assumption, computational complexity, computational geometry, minimisation, graph colouring, hardness, minimization problems
21Peyman Shobeiri, Mehdi Akbarian Rastaghi, Saeid Abrishami, Behnam Shobiri PCP-ACO: a hybrid deadline-constrained workflow scheduling algorithm for cloud environment. Search on Bibsonomy J. Supercomput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
21Anand Natarajan, Chinmay Nirkhe The status of the quantum PCP conjecture (games version). Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
21Vesa Halava, Stepan Holub Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
21Vanha Tran Meta-PCP: A concise representation of prevalent co-location patterns discovered from spatial data. Search on Bibsonomy Expert Syst. Appl. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Soni Pranshu Kumar, Nelson Leema PCP: Profit-Driven Churn Prediction using Machine Learning Techniques in Banking Sector. Search on Bibsonomy Int. J. Perform. Eng. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Elif E. Firat, Ben Swallow, Robert S. Laramee PCP-Ed: Parallel coordinate plots for ensemble data. Search on Bibsonomy Vis. Informatics The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Jordi Weggemans, Marten Folkertsma, Chris Cade Guidable Local Hamiltonian Problems with Implications to Heuristic Ansätze State Preparation and the Quantum PCP Conjecture. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Sevag Gharibian, François Le Gall Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Xinyang Deng, Tianhan Gao, Nan Guo, Cong Zhao, Jiayu Qi PCP: A Pseudonym Change Scheme for Location Privacy Preserving in VANETs. Search on Bibsonomy Entropy The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Vikas Singh, Shachi Sharma AHP-PCP: AHP based Probabilistic Consensus Protocol for Probabilistic Knowledge-based Blockchains. Search on Bibsonomy ANTS The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Gal Arnon, Alessandro Chiesa, Eylon Yogev A PCP Theorem for Interactive Proofs and Applications. Search on Bibsonomy EUROCRYPT (2) The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Sevag Gharibian, François Le Gall Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Cristina Cornelio, Judy Goldsmith, Umberto Grandi, Nicholas Mattei, Francesca Rossi 0001, Kristen Brent Venable Reasoning with PCP-Nets. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Sevag Gharibian, François Le Gall Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
21Hengzhao Ma, Jianzhong Li 0001 The PCP-like Theorem for Sub-linear Time Inapproximability. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
21George Kadianakis, Theodoros Polyzos, Mike Perry, Kostas Chatzikokolakis 0001 PCP: Preemptive Circuit Padding against Tor circuit fingerprinting. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
21Gal Arnon, Alessandro Chiesa, Eylon Yogev A PCP Theorem for Interactive Proofs. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2021 DBLP  BibTeX  RDF
21Klaus Meer A PCP of Proximity for Real Algebraic Polynomials. Search on Bibsonomy CSR The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Abhishek Patyal, Po-Cheng Pan, K. A. Asha, Hung-Ming Chen, Wei-Zen Chen Exploring Multiple Analog Placements With Partial-Monotonic Current Paths and Symmetry Constraints Using PCP-SP. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21 PCP Theorems, SETH and More: Towards Proving Sub-linear Time Inapproximability. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
21Nagaganesh Jaladanki, Wilson Wu Distributed Verifiers in PCP. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 270 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license