Suchergebnisse - "Guruswami, Venkatesan"

New Spectral Algorithms for Refuting Smoothed k-SAT.

Autoren: Guruswami, Venkatesan Kothari, Pravesh K. Manohar, Peter

Quelle: Communications of the ACM; Mar2025, Vol. 68 Issue 3, p83-91, 9p

Schlagwörter: COMBINATORICS, ALGORITHMS, SATISFIABILITY (Computer science), HYPERGRAPHS, CONSTRAINT satisfaction

People: KARP, R. M., FEIGE, Uriel

Parameterized Inapproximability Hypothesis under ETH.

Autoren: Guruswami, Venkatesan Lin, Bingkai Ren, Xuandi et al.

Quelle: Journal of the ACM; Oct2025, Vol. 72 Issue 5, p1-40, 40p

Schlagwörter: COMPUTATIONAL complexity, CONSTRAINT satisfaction, HADAMARD codes

APPROXIMATE HYPERGRAPH VERTEX COVER AND GENERALIZED TUZA'S CONJECTURE.

Autoren: GURUSWAMI, VENKATESAN SANDEEP, SAI

Quelle: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 2, p1312-1334, 23p

Schlagwörter: HYPERGRAPHS, APPROXIMATION algorithms, COMBINATORIAL optimization

Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes.

Autoren: GURUSWAMI, VENKATESAN CHAOPING XING

Quelle: Journal of the ACM; Mar2022, Vol. 69 Issue 2, p1-48, 48p

Schlagwörter: ALGEBRAIC codes, DECODING algorithms, BLOCK codes, DETERMINISTIC algorithms, REED-Solomon codes

General Strong Polarization.

Autoren: BŁASIOK, JAROSŁAW GURUSWAMI, VENKATESAN NAKKIRAN, PREETUM et al.

Quelle: Journal of the ACM; Mar2022, Vol. 69 Issue 2, p1-67, 67p

Schlagwörter: MARTINGALES (Mathematics), CHANNEL coding, ERROR probability, SOURCE code

PARAMETERIZED INAPPROXIMABILITY OF THE MINIMUM DISTANCE PROBLEM OVER ALL FIELDS AND THE SHORTEST VECTOR PROBLEM IN ALL ℓp NORMS.

Autoren: BENNETT, HUCK CHERAGHCHI, MAHDI GURUSWAMI, VENKATESAN et al.

Quelle: SIAM Journal on Computing; 2024, Vol. 53 Issue 5, p1439-1475, 37p

Schlagwörter: BINARY codes, VECTOR fields, FINITE fields, ARBITRARY constants, HARDNESS

THE POWER OF THE COMBINED BASIC LINEAR PROGRAMMING AND AFFINE RELAXATION FOR PROMISE CONSTRAINT SATISFACTION PROBLEMS.

Autoren: BRAKENSIEK, JOSHUA GURUSWAMI, VENKATESAN WROCHNA, MARCIN et al.

Quelle: SIAM Journal on Computing; 2020, Vol. 49 Issue 6, p1232-1248, 17p

Schlagwörter: CONSTRAINT satisfaction, AFFINAL relatives, STATISTICAL decision making, GRAPH coloring, POLYNOMIAL time algorithms

The Power of the Combined Basic LP and Affine Relaxation for Promise CSPs

Autoren: Brakensiek, Joshua Guruswami, Venkatesan Wrochna, Marcin et al.

Index Begriffe: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity, Computer Science - Logic in Computer Science, text

URL: http://arxiv.org/abs/1907.04383

Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes

Autoren: Guruswami, Venkatesan Umans, Christopher Vadhan, Salil

Quelle: Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), San Diego, CA, June 13-16, 2007

Relation: https://authors.library.caltech.edu/communities/caltechauthors/; https://doi.org/10.1109/CCC.2007.38; eprintid:76967

Verfügbarkeit: https://doi.org/10.1109/CCC.2007.38

Polar Codes with Exponentially Small Error at Finite Block Length

Autoren: Blasiok, Jaroslaw Guruswami, Venkatesan Sudan, Madhu

Index Begriffe: Polar codes, error exponent, rate of polarization, Data processing Computer science, InProceedings, publishedVersion

EFFICIENT LINEAR AND AFFINE CODES FOR CORRECTING INSERTIONS/DELETIONS.

Autoren: KUAN CHENG GURUSWAMI, VENKATESAN HAEUPLER, BERNHARD et al.

Quelle: SIAM Journal on Discrete Mathematics; 2023, Vol. 37 Issue 2, p748-778, 31p

Schlagwörter: LINEAR codes, ERROR-correcting codes, BINARY codes, HAMMING codes

Non-malleable Coding Against Bit-Wise and Split-State Tampering.

Autoren: Cheraghchi, Mahdi Guruswami, Venkatesan

Quelle: Journal of Cryptology; Jan2017, Vol. 30 Issue 1, p191-241, 51p

Schlagwörter: ERROR detection (Information theory), DECODERS (Electronics), PRODUCT tampering, MONTE Carlo method, POLYNOMIALS

Explicit Capacity-achieving Codes for Worst-Case Additive Errors

Autoren: Guruswami, Venkatesan Smith, Adam

Index Begriffe: Computer Science - Information Theory, Computer Science - Computational Complexity, Mathematics - Combinatorics, text

URL: http://arxiv.org/abs/0912.0965

Inapproximability of matrix p → q norms.

Autoren: BHATTIPROLU, VIJAY GHOSH, MRINAL KANTI GURUSWAMI, VENKATESAN et al.

Quelle: SIAM Journal on Computing; 2023, Vol. 52 Issue 1, p132-155, 24p

Schlagwörter: MATRIX norms, APPROXIMATION algorithms, NP-hard problems, POLYNOMIALS, ALGORITHMS

Improved Maximally Recoverable LRCs Using Skew Polynomials.

Autoren: Gopi, Sivakanth Guruswami, Venkatesan

Quelle: IEEE Transactions on Information Theory; Nov2022, Vol. 68 Issue 11, p7198-7214, 17p

Schlagwörter: LINEAR codes, REED-Solomon codes, CODING theory, FAULT tolerance (Engineering), COMPLEXITY (Philosophy), DECODING algorithms

CNF Satisfiability in a Subspace and Related Problems.

Autoren: Arvind, V. Guruswami, Venkatesan

Quelle: Algorithmica; Nov2022, Vol. 84 Issue 11, p3276-3299, 24p

Schlagwörter: ALGEBRAIC spaces, POLYNOMIAL time algorithms, LINEAR equations, POLYNOMIALS, CRITICAL analysis, ASSIGNMENT problems (Programming)

List Decoding and Pseudorandom Constructions.

Autoren: Hutchison, David Kanade, Takeo Kittler, Josef et al.

Quelle: Applied Algebra, Algebraic Algorithms & Error-Correcting Codes (978-3-540-77223-1); 2007, p1-6, 6p

What fraction of worst-case bit deletions are correctable?

Autoren: Guruswami, Venkatesan

Schlagwörter: Mathematics, Computer science, Theoretical computer science

Geographisches Schlagwort: Banff (Alta.)

Dateibeschreibung: 29 minutes; video/mp4

Relation: 16w5044: Computational Complexity; BIRS Workshop Lecture Videos (Banff, Alta); BIRS-VIDEO-201609051604-Guruswami; BIRS-VIDEO-16w5044-19184; http://hdl.handle.net/2429/60804

Verfügbarkeit: http://hdl.handle.net/2429/60804

Optimal Rate Code Constructions for Computationally Simple Channels.

Autoren: GURUSWAMI, VENKATESAN SMITH, ADAM

Quelle: Journal of the ACM; Sep2016, Vol. 63 Issue 4, p35-35:37, 37p

Schlagwörter: ARBITRARY constants, FRACTIONAL differential equations, POLYNOMIAL time algorithms, PROBABILITY in quantum mechanics, MEMORYLESS systems

Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets

Autoren: Guruswami, Venkatesan Xing, Chaoping School of Physical and Mathematical Sciences et al.

Weitere Verfasser: Guruswami, Venkatesan Xing, Chaoping School of Physical and Mathematical Sciences et al.

Quelle: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. :1858-1866

Schlagwörter: Science::Mathematics::Discrete mathematics::Algorithms [DRNTU], 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.134
https://dr.ntu.edu.sg/bitstream/10356/106724/1/Optimal%20rate%20list%20decoding%20of%20folded%20algebraic-geometric%20codes%20over%20constant-sized%20alphabets.pdf
https://doi.org/10.1137/1.9781611973402.134
https://dr.ntu.edu.sg/handle/10356/106724
https://dl.acm.org/doi/10.5555/2634074.2634208
https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.134
https://dblp.uni-trier.de/db/conf/soda/soda2014.html#GuruswamiX14
http://epubs.siam.org/doi/abs/10.1137/1.9781611973402.134
http://hdl.handle.net/10220/25106
https://hdl.handle.net/10356/106724