Explicit deterministic constructions for membership in the bitprobe model
From MaRDI portal
Recommendations
- Constructivizing Membership Proofs in Complexity Classes
- The complexity of generating and checking proofs of membership
- On dynamic bit-probe complexity
- Automata, Languages and Programming
- Bit-probe lower bounds for succinct data structures
- Bit-probe lower bounds for succinct data structures
- Improved explicit data structures in the bitprobe model
- Towards satisfiability modulo parametric bit-vectors
- Set membership with non-adaptive bit probes
- scientific article; zbMATH DE number 176875
Cited in
(15)- Revisiting explicit adaptive two-probe schemes
- The quantum complexity of set membership
- Storing four elements in the two query bitprobe model
- On the bitprobe complexity of two probe adaptive schemes
- Lower bounds for restricted schemes in the two-adaptive bitprobe model
- Determining membership with 2 simultaneous queries
- Two improved schemes in the bitprobe model
- The cell probe complexity of succinct data structures
- A Survey of Data Structures in the Bitprobe Model
- Improved explicit data structures in the bitprobe model
- scientific article; zbMATH DE number 512871 (Why is no real title available?)
- Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes
- Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements
- Integer Representation and Counting in the Bit Probe Model
- Integer representation and counting in the bit probe model
This page was built for publication: Explicit deterministic constructions for membership in the bitprobe model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796182)
