Search results for "BPP"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
129	Tomoyuki Yamakami	Nearly Bounded Error Probabilistic Sets.	CIAC	2003	DBLP DOI BibTeX RDF
94	Russell Impagliazzo	Can every randomized algorithm be derandomized?	STOC	2006	DBLP DOI BibTeX RDF	algebraic circuit complexity, probabilistic algorithms, derandomization, circuit complexity, complexity classes, pseudo-randomness
93	Ivana Cerná, Mojmír Kretínský, Antonín Kucera 0001	Comparing Expressibility of Normed BPA and Normed BPP Processes.	Acta Informatica	1999	DBLP DOI BibTeX RDF
93	Stathis Zachos	A New Characterization of BPP.	FSTTCS	1984	DBLP DOI BibTeX RDF	Probalistic algorithms, polynomial time complexity classes, oracles, polynomial hierarchies
71	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan	Weak Random Sources, Hitting Sets, and BPP Simulations.	FOCS	1997	DBLP DOI BibTeX RDF	BPP simulations, parallel classes, lower bound, sampling, polynomial time, randomised algorithms, hitting sets, weak random source, weak random sources, min-entropy
59	Mariusz Glabowski	Recurrent Method for Blocking Probability Calculation in Multi-service Switching Networks with BPP Traffic.	EPEW	2008	DBLP DOI BibTeX RDF	BPP traffic, blocking probability, switching networks
59	Zheng He, Qi Zhang 0013, Villy Bæk Iversen	Trunk Reservation in Multi-service Networks with BPP Traffic.	EuroNGI Workshop	2006	DBLP DOI BibTeX RDF	BPP traffic, multi-rate traffic, wireless systems, trunk reservation
59	Jirí Srba	Note on the Tableau Technique for Commutative Transition Systems.	FoSSaCS	2002	DBLP DOI BibTeX RDF
59	Richard Mayr	On the Complexity of Bisimulation Problems for Basic Parallel Processes.	ICALP	2000	DBLP DOI BibTeX RDF
58	Petr Jancar, Martin Kot, Zdenek Sawa	Normed BPA vs. Normed BPP Revisited.	CONCUR	2008	DBLP DOI BibTeX RDF	Basic Process Algebra, Basic Parallel Processes, verification, equivalence checking, bisimulation equivalence
58	Slawomir Lasota 0001	Decidability of Strong Bisimilarity for Timed BPP.	CONCUR	2002	DBLP DOI BibTeX RDF
58	Avi Wigderson	De-Randomizing BPP: The State of the Art.	CCC	1999	DBLP DOI BibTeX RDF
48	Eric Allender, Martin Strauss 0001	Measure on Small Complexity Classes, with Applications for BPP	FOCS	1994	DBLP DOI BibTeX RDF	resource-bounded measure theory, small complexity classes, BPP, subexponential-time classes, class of sets, resource-bounded measure
47	Mariusz Glabowski	Modelling of state-dependent multirate systems carrying BPP traffic.	Ann. des Télécommunications	2008	DBLP DOI BibTeX RDF	State-dependent systems, BPP traffic, Multiservice traffic, Bandwidth reservation
47	David Zuckerman	Simulating BPP Using a General Weak Random Source	FOCS	1991	DBLP DOI BibTeX RDF	probe search, BPP simulation, general weak random source, R-bit string, approximation algorithms, polynomial time, maximum clique, weak random source
47	Haiyan Chen	More on Weak Bisimilarity of Normed Basic Parallel Processes.	TAMC	2008	DBLP DOI BibTeX RDF
47	Xiaoyang Gu, Jack H. Lutz	Dimension Characterizations of Complexity Classes.	MFCS	2006	DBLP DOI BibTeX RDF
47	Clemens Grabmayer, Jan Willem Klop, Bas Luttik	Some Remarks on Definability of Process Graphs.	CONCUR	2006	DBLP DOI BibTeX RDF
47	Jirí Srba	Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard.	STACS	2002	DBLP DOI BibTeX RDF
47	Amirali Baniasadi, Andreas Moshovos	Branch Predictor Prediction: A Power-Aware Branch Predictor for High-Performance Processors.	ICCD	2002	DBLP DOI BibTeX RDF
47	Russell Impagliazzo, Valentine Kabanets, Avi Wigderson	In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time.	CCC	2001	DBLP DOI BibTeX RDF
46	Hongfei Fu 0001	Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable.	APLAS	2009	DBLP DOI BibTeX RDF
46	Naoki Kobayashi 0001, Takashi Suto	Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the pi -Calculus.	ICALP	2007	DBLP DOI BibTeX RDF
46	Sibylle B. Fröschle, Slawomir Lasota 0001	Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP.	CONCUR	2005	DBLP DOI BibTeX RDF
46	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim	Hitting Sets Derandomize BPP.	ICALP	1996	DBLP DOI BibTeX RDF
46	Nobuki Yoda, Takeo Igarashi	Decomposition of 32 bpp into 16 bpp textures with alpha.	SIGGRAPH Posters	2015	DBLP DOI BibTeX RDF
46	Oded Goldreich 0001, David Zuckerman	Another Proof That BPP Í PH\mathcal{BPP}\subseteq \mathcal{PH} (and More).	Studies in Complexity and Cryptography	2011	DBLP DOI BibTeX RDF
46	Philippe Moser	BPP has effective dimension at most 1/2 unless BPP=EXP	Electron. Colloquium Comput. Complex.	2003	DBLP BibTeX RDF
37	Valentine Kabanets, Russell Impagliazzo	Derandomizing polynomial identity tests means proving circuit lower bounds.	STOC	2003	DBLP DOI BibTeX RDF	BPP, NEXP, circuit lower bounds, derandomization, polynomial identity testing
37	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim	A New General Derandomization Method.	J. ACM	1998	DBLP DOI BibTeX RDF	BPP, derandomization, Boolean circuits
36	Juan Javier González Barbosa, Laura Cruz Reyes, José Francisco Delgado Orta, Héctor Joaquín Fraire Huacuja, Guadalupe Castilla Valdez, Víctor Jesús Sosa Sosa	Less Expensive Formulation for a Realistic Routing-Scheduling-Loading Problem (RoSLoP).	DCAI	2008	DBLP DOI BibTeX RDF	Routing-Scheduling-Loading Problem (RoSLoP), Bin Packing Problem (BPP), Complexity, Vehicle Routing Problem (VRP)
35	Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota 0001	Partially-Commutative Context-Free Processes.	CONCUR	2009	DBLP DOI BibTeX RDF
35	Xiaoyang Gu, Jack H. Lutz	Dimension Characterizations of Complexity Classes.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	Subject classification, 68Q15
35	Lucia Acciai, Michele Boreale	Type Abstractions of Name-Passing Processes.	FSEN	2007	DBLP DOI BibTeX RDF
35	Jag Mohan Singh, P. J. Narayanan	Progressive Decomposition of Point Clouds Without Local Planes.	ICVGIP	2006	DBLP DOI BibTeX RDF
35	Stefano Lonardi, Yu Luo	Gridding and Compression of Microarray Images.	CSB	2004	DBLP DOI BibTeX RDF
35	Jirí Srba	Strong bisimilarity of simple process algebras: complexity lower bounds.	Acta Informatica	2003	DBLP DOI BibTeX RDF
35	Rebecka Jörnsten, Bin Yu 0001	Compression of cDNA microarray images.	ISBI	2002	DBLP DOI BibTeX RDF
35	Oded Goldreich 0001, Avi Wigderson	Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good.	RANDOM	2002	DBLP DOI BibTeX RDF
35	Valentine Kabanets	Easiness Assumptions and Hardness Tests: Trading Time for Zero Error.	CCC	2000	DBLP DOI BibTeX RDF	probabilistic complexity classes, uniform setting, derandomization
35	Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer	Magic Functions.	FOCS	1999	DBLP DOI BibTeX RDF	interactive argument, magic function, selective decommitment, three-round protocol, cryptography, distributed computing, zero knowledge, complexity theory, signature scheme, commitment scheme
35	Harry Buhrman, Lance Fortnow	One-sided Versus Two-sided Error in Probabilistic Computation.	STACS	1999	DBLP DOI BibTeX RDF
35	Sheng-Chieh Huang, Liang-Gee Chen, Hao-Chieh Chang	A novel image compression algorithm by using Log-Exp transform.	ISCAS (4)	1999	DBLP DOI BibTeX RDF
35	Avi Wigderson	Do Probabilistic Algorithms Outperform Deterministic Ones?	ICALP	1998	DBLP DOI BibTeX RDF
35	Juris Hartmanis, Lane A. Hemachandra	Complexity Classes Without Machines: On Complete Languages for UP.	ICALP	1986	DBLP DOI BibTeX RDF
35	Eunice López-Camacho, Hugo Terashima-Marín, Peter Ross, Manuel Valenzuela-Rendón	Problem-state representations in a hyper-heuristic approach for the 2D irregular BPP.	GECCO	2010	DBLP DOI BibTeX RDF	2D irregular binpacking problems, Problem State Representation, optimization, evolutionary computation, hyper-heuristics
35	Junfeng Xiao, Biao Ren, Shiduan Cheng	A BPP-Based Scheduling Algorithm in Bluetooth Systems.	MSN	2005	DBLP DOI BibTeX RDF
24	Aravind Srinivasan, David Zuckerman	Computing with Very Weak Random Sources	FOCS	1994	DBLP DOI BibTeX RDF	randomness-efficient Leftover Hash Lemma, very weak random sources, RP algorithms simulation, R-bit string, BPP simulations, Chor-Goldreich sources, expander constructions, probability, hardness, time-space tradeoffs, min-entropy
24	Russell Impagliazzo, David Zuckerman	How to Recycle Random Bits	FOCS	1989	DBLP DOI BibTeX RDF	random bits, shift register generator, BPP algorithm, information-theoretic lower bound, probabilistic algorithm, pseudorandom generator, linear congruential generator, linear congruential generators
24	Aviad Cohen 0001, Avi Wigderson	Dispersers, Deterministic Amplification, and Weak Random Sources (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	weak bit fixing sources, RP algorithm, BPP algorithm, deterministic amplification, bipartite multigraphs, probabilistic algorithms, dispersers, error probability, weak random sources
23	Dmitry Itsykson	Structural Complexity of AvgBPP.	CSR	2009	DBLP DOI BibTeX RDF
23	J. Wang, Y. C. Jeung, J. W. Chong	Improved block truncation coding using low cost approach for color image compression.	ICIS	2009	DBLP DOI BibTeX RDF	adaptive quantization coding, block truncation coding, color image compression
23	Tomás Brázdil, Antonín Kucera 0001, Oldrich Strazovský	Deciding probabilistic bisimilarity over infinite-state probabilistic systems.	Acta Informatica	2008	DBLP DOI BibTeX RDF
23	Firas Hassan, Joan Carletta	High throughput JPEG2000 compatible encoder for high dynamic range images.	ICIP	2008	DBLP DOI BibTeX RDF
23	Soumyadip Rakshit, Donald M. Monro	An Evaluation of Image Sampling and Compression for Human Iris Recognition.	IEEE Trans. Inf. Forensics Secur.	2007	DBLP DOI BibTeX RDF
23	Dror Alani, Amir Averbuch, Shai Dekel	Image Coding With Geometric Wavelets.	IEEE Trans. Image Process.	2007	DBLP DOI BibTeX RDF
23	Matthew Gaubatz, Sheila S. Hemami	Robust Rate-Control for Wavelet-Based Image Coding via Conditional Probability Models.	IEEE Trans. Image Process.	2007	DBLP DOI BibTeX RDF
23	Jin-yi Cai, Venkatesan T. Chakaravarthy	On zero error algorithms having oracle access to one query.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF
23	Weisi Lin, Li Dong	Adaptive downsampling to improve image compression at low bit rates.	IEEE Trans. Image Process.	2006	DBLP DOI BibTeX RDF
23	Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets	Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification.	FOCS	2006	DBLP DOI BibTeX RDF
23	Dekun Zou, Yun Q. Shi 0001, Wei Su 0001, Guorong Xuan	Steganalysis based on Markov Model of Thresholded Prediction-Error Image.	ICME	2006	DBLP DOI BibTeX RDF
23	Will Harwood, Faron Moller, Anton Setzer	Weak Bisimulation Approximants.	CSL	2006	DBLP DOI BibTeX RDF
23	Ronen Shaltiel, Christopher Umans	Simple extractors for all min-entropies and a new pseudorandom generator.	J. ACM	2005	DBLP DOI BibTeX RDF	Hardness versus randomness, pseudorandom generator, randomness extractor
23	Guorong Xuan, Yun Q. Shi 0001, Jianjiong Gao, Dekun Zou, Chengyun Yang, Zhenping Zhang, Peiqi Chai, Chunhua Chen 0001, Wen Chen 0002	Steganalysis Based on Multiple Features Formed by Statistical Moments of Wavelet Characteristic Functions.	Information Hiding	2005	DBLP DOI BibTeX RDF
23	Martin Beaudry, José M. Fernandez 0001, Markus Holzer 0001	A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract).	MFCS	2004	DBLP DOI BibTeX RDF
23	Tomás Brázdil, Antonín Kucera 0001, Oldrich Strazovský	Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems.	CONCUR	2004	DBLP DOI BibTeX RDF
23	John M. Hitchcock	Small Spans in Scaled Dimension.	CCC	2004	DBLP DOI BibTeX RDF
23	Takashi Mihara, Shao Chin Sung	Deterministic polynomial-time quantum algorithms for Simon's problem.	Comput. Complex.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 03D15, 81P68, 68Q25, 68Q05
23	Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer	Magic Functions.	J. ACM	2003	DBLP DOI BibTeX RDF	Fiat-Shamir methodology, interactive argument, magic function, selective decommitment, Digital signature, zero knowledge, interactive proof system
23	Petr Jancar	Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete.	LICS	2003	DBLP DOI BibTeX RDF
23	Luca Trevisan	List-Decoding Using The XOR Lemma.	FOCS	2003	DBLP DOI BibTeX RDF
23	Philippe Moser	Baire's Categories on Small Complexity Classes.	FCT	2003	DBLP DOI BibTeX RDF
23	Rahul Santhanam, Dieter van Melkebeek	Holographic Proofs and Derandomization.	CCC	2003	DBLP DOI BibTeX RDF
23	Yevgeniy Dodis, Joel Spencer	On the (non)Universality of the One-Time Pad.	FOCS	2002	DBLP DOI BibTeX RDF
23	Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano	Randomness-Optimal Characterization of Two NP Proof Systems.	RANDOM	2002	DBLP DOI BibTeX RDF
23	Nicholas J. Adams, Christopher K. I. Williams	Dynamic Trees: Learning to Model Outdoor Scenes.	ECCV (4)	2002	DBLP DOI BibTeX RDF
23	Artur Przelaskowski	Hybrid Lossless Coder of Medical Images with Statistical Data Modelling.	CAIP	2001	DBLP DOI BibTeX RDF	reversible hybrid coders, statistical modeling, medical image compression
23	Raouf Hamzaoui, Dietmar Saupe	Combining fractal image compression and vector quantization.	IEEE Trans. Image Process.	2000	DBLP DOI BibTeX RDF
23	Béatrice Bérard, Anne Labroue, Philippe Schnoebelen	Verifying Performance Equivalence for Timed Basic Parallel Processes.	FoSSaCS	2000	DBLP DOI BibTeX RDF
23	Kunal Mukherjee, Amar Mukherjee, Tinku Acharya	Distributed Internet-Adaptive Image Compression.	Data Compression Conference	2000	DBLP DOI BibTeX RDF
23	Satoshi Hada	Zero-Knowledge and Code Obfuscation.	ASIACRYPT	2000	DBLP DOI BibTeX RDF
23	Jin-yi Cai, Aduri Pavan, D. Sivakumar	On the Hardness of Permanent.	STACS	1999	DBLP DOI BibTeX RDF
23	Petr Jancar, Faron Moller	Techniques for Decidability and Undecidability of Bisimilarity.	CONCUR	1999	DBLP DOI BibTeX RDF
23	Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss 0001	A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract).	STACS	1998	DBLP DOI BibTeX RDF
23	Donald M. Monro, Huijuan Li, Jeremy A. Nicholls	Object Based Video with Progressive Foreground.	ICIP (3)	1997	DBLP DOI BibTeX RDF
23	Harry Buhrman, Stephen A. Fenner, Lance Fortnow	Results on Resource-Bounded Measure.	ICALP	1997	DBLP DOI BibTeX RDF
23	Richard Mayr	Weak Bisimulation and Model Checking for Basic Parallel Processes.	FSTTCS	1996	DBLP DOI BibTeX RDF	Basic Parallel Processes, model checking, bisimulation
23	Ahmed Bouajjani, Rachid Echahed, Peter Habermehl	Verifying Infinite State Processes with Sequential and Parallel Composition.	POPL	1995	DBLP DOI BibTeX RDF
23	Ingrid Biehl	Definition and Existence of Super Complexity Cores.	ISAAC	1994	DBLP DOI BibTeX RDF
23	Lijie Chen 0001, Roei Tell	New ways of studying the BPP = P conjecture.	Electron. Colloquium Comput. Complex.	2023	DBLP BibTeX RDF
23	Lijie Chen 0001, Roei Tell	Guest Column: New ways of studying the BPP = P conjecture.	SIGACT News	2023	DBLP DOI BibTeX RDF
23	Florian Kagerer, Maximilian Beinhofer, Stefan Stricker, Andreas Nüchter	BED-BPP: Benchmarking dataset for robotic bin packing problems.	Int. J. Robotics Res.	2023	DBLP DOI BibTeX RDF
23	Meriem Hsayri, Mounira Tlili	A novel multi stage optimization algorithm for a 3D-BPP resolution.	INISTA	2023	DBLP DOI BibTeX RDF
23	Joanna Weissenberg, Michal Weissenberg	Model of a Queuing System With BPP Elastic and Adaptive Traffic.	IEEE Access	2022	DBLP DOI BibTeX RDF
23	Roberto Gorrieri	A study on team bisimulation and H-team bisimulation for BPP nets.	Theor. Comput. Sci.	2022	DBLP DOI BibTeX RDF
23	Roberto Gorrieri	Causal Semantics for BPP Nets with Silent Moves.	Fundam. Informaticae	2021	DBLP DOI BibTeX RDF
23	Roberto Gorrieri	Team bisimilarity, and its associated modal logic, for BPP nets.	Acta Informatica	2021	DBLP DOI BibTeX RDF
23	Yanyi Liu, Rafael Pass	On the Possibility of Basing Cryptography on $\EXP \neq \BPP$.	Electron. Colloquium Comput. Complex.	2021	DBLP BibTeX RDF
23	Yanyi Liu, Rafael Pass	On the Possibility of Basing Cryptography on $\EXP \neq \BPP$.	IACR Cryptol. ePrint Arch.	2021	DBLP BibTeX RDF
23	Yanyi Liu, Rafael Pass	On the Possibility of Basing Cryptography on EXP≠ BPP.	CRYPTO (1)	2021	DBLP DOI BibTeX RDF