Search results for "linear-length"

Found 19 publication records. Showing 19 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
41	Oded Goldreich 0001, Madhu Sudan 0001	Locally testable codes and PCPs of almost-linear length.	J. ACM	2006	DBLP DOI BibTeX RDF	error-correcting codes, derandomization, probabilistically checkable proofs, Proof verification
41	Oded Goldreich 0001, Madhu Sudan 0001	Locally Testable Codes and PCPs of Almost-Linear Length.	FOCS	2002	DBLP DOI BibTeX RDF
21	Martin Sauerhoff	Randomized Branching Programs.	SAGA	2001	DBLP DOI BibTeX RDF	Randomized branching program, read-k-times, linear-length, lower bounds, randomness, nondeterminism, OBDD
11	Joshua A. Grochow, Youming Qiao	On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications.	CoRR	2023	DBLP DOI BibTeX RDF
11	Chengwu Yang, Tong Ye, Ke Zhang, Zhenning Tao, Hisao Nakashima, Takeshi Hoshida	A Sensitive Method for Estimating the Linear Length of a System.	OECC/PSC	2022	DBLP DOI BibTeX RDF
11	Xiangliang Kong, Xin Wang 0065, Gennian Ge	New Constructions of Optimal Locally Repairable Codes With Super-Linear Length.	IEEE Trans. Inf. Theory	2021	DBLP DOI BibTeX RDF
11	Han Cai, Ying Miao 0001, Moshe Schwartz 0001, Xiaohu Tang	On Optimal Locally Repairable Codes With Super-Linear Length.	IEEE Trans. Inf. Theory	2020	DBLP DOI BibTeX RDF
11	Xiangliang Kong, Xin Wang 0065, Gennian Ge	New Constructions of Optimal Locally Repairable Codes with Super-Linear Length.	CoRR	2020	DBLP BibTeX RDF
11	Han Cai, Ying Miao 0001, Moshe Schwartz 0001, Xiaohu Tang	On Optimal Locally Repairable Codes with Super-Linear Length.	ISIT	2019	DBLP DOI BibTeX RDF
11	Han Cai, Ying Miao 0001, Moshe Schwartz 0001, Xiaohu Tang	On Optimal Locally Repairable Codes with Super-Linear Length.	CoRR	2018	DBLP BibTeX RDF
11	Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan	Pseudorandomness for Linear Length Branching Programs and Stack Machines.	APPROX-RANDOM	2012	DBLP DOI BibTeX RDF
11	Magnus Wahlström	An Algorithm for the SAT Problem for Formulae of Linear Length.	ESA	2005	DBLP DOI BibTeX RDF
11	Oded Goldreich 0001, Madhu Sudan 0001	Locally Testable Codes and PCPs of Almost-Linear Length	Electron. Colloquium Comput. Complex.	2002	DBLP BibTeX RDF
11	Carsten Damm, Matthias Krause 0001, Christoph Meinel, Stephan Waack	Separating Oblivious Linear Length MODp-Branching Program Classes.	J. Inf. Process. Cybern.	1994	DBLP BibTeX RDF
11	Stephan Waack, Matthias Krause 0001	On Oblivious Branching Programs of Linear Length	Inf. Comput.	1991	DBLP DOI BibTeX RDF
11	Matthias Krause 0001, Stephan Waack	On Oblivious Branching Programs of Linear Length (Extended Abstract).	FCT	1989	DBLP DOI BibTeX RDF
7	Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman	Distributed Cooperation During the Absence of Communication.	DISC	2000	DBLP DOI BibTeX RDF
4	Beate Bollig, Martin Sauerhoff, Ingo Wegener	On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs.	CCC	2001	DBLP DOI BibTeX RDF	Computational complexity, lower bounds, approximations, binary decision diagrams, branching programs
4	Josef M. Breutzmann, Jack H. Lutz	Equivalence of Measures of Complexity Classes.	STACS	1997	DBLP DOI BibTeX RDF