TDG
Scholar
Committed to research!
Version 1.7
Home

Bibliography

Writers

Journals

Conferences

Publishers
Help

News
Bibliography
Refine on click

Report

Share
More than 125 records were found in 5.812 seconds
Fetch

Report

Google
Highorder time stepping for the NavierStokes equations with minimal computational complexity
JeanLuc Guermond
,
Peter D. Minev
J. Computational Applied Mathematics
,
31092103
,
2017
Fetch

Report

Google
Computational complexity reduction in nonuniform compressed sensing by multicoset emulation
Ruben Grigoryan
,
Tobias Lindstrøm Jensen
,
Torben Larsen
Signal Processing
,
131492501
,
2017
Fetch

Report

Google
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections
Leon Kellerhals
,
Viatcheslav Korenwein
,
Philipp Zschoche
,
Robert Bredereck
,
Jiehua Chen
CoRR
,
abs/1701.05108
,
2017
Fetch

Report

Google
Magic Adversaries Versus Individual Reduction: Science Wins Either Way
Yi Deng
Electronic Colloquium on Computational Complexity (ECCC)
,
243
,
2017
Fetch

Report

Google
Some notes on two lower bound methods for communication complexity
Frantisek Duris
Electronic Colloquium on Computational Complexity (ECCC)
,
242
,
2017
Fetch

Report

Google
P=?NP
Scott Aaronson
Electronic Colloquium on Computational Complexity (ECCC)
,
244
,
2017
Fetch

Report

Google
A Survey of Classes of Primitive Recursive Functions
Stephen A. Cook
,
Bruce M. Kapron
Electronic Colloquium on Computational Complexity (ECCC)
,
241
,
2017
Fetch

Report

Google
Computational Complexity of a Hybridized Horn Fragment of HalpernShoham Logic
Przemyslaw Andrzej Walega
ICLA
,
224238
,
2017
Fetch

Report

Google
A Low Computational Complexity Algorithm for Compressive Wideband Spectrum Sensing
Shiyu Ren
,
Zhimin Zeng
,
Caili Guo
,
Xuekang Sun
,
Kun Su
IEICE Transactions
,
100A(1):294300
,
2017
Fetch

Report

Google
Low Computational Complexity DirectionofArrival Estimation of Wideband Signal Sources Based on Squared TOPS
Hirotaka Hayashi
,
Tomoaki Ohtsuki
IEICE Transactions
,
100A(1):219226
,
2017
Fetch

Report

Google
Settling the Query Complexity of NonAdaptive Junta Testing
Xi Chen 0001
,
Rocco A. Servedio
,
LiYang Tan
,
Erik Waingarten
,
Jinyu Xie
Computational Complexity Conference
,
26:126:19
,
2017
Fetch

Report

Google
Trading Information Complexity for Error
Yuval Dagan
,
Yuval Filmus
,
Hamed Hatami
,
Yaqiao Li
Computational Complexity Conference
,
16:116:59
,
2017
Fetch

Report

Google
Easiness Amplification and Uniform Circuit Lower Bounds
Cody D. Murray
,
R. Ryan Williams
Computational Complexity Conference
,
8:18:21
,
2017
Fetch

Report

Google
Exponentially Small Soundness for the Direct Product ZTest
Irit Dinur
,
Inbal Livni Navon
Computational Complexity Conference
,
29:129:50
,
2017
Fetch

Report

Google
Reconstruction of Full Rank Algebraic Branching Programs
Neeraj Kayal
,
Vineet Nair
,
Chandan Saha 0001
,
Sébastien Tavenas
Computational Complexity Conference
,
21:121:61
,
2017
Fetch

Report

Google
The Computational Complexity of Weighted Greedy Matching
Argyrios Deligkas
,
George B. Mertzios
,
Paul G. Spirakis
AAAI
,
466474
,
2017
Fetch

Report

Google
On Computational Complexity of Set Automata
Alexander A. Rubtsov
,
Mikhail N. Vyalyi
DLT
,
332344
,
2017
Fetch

Report

Google
The computational complexity of ball permutations
Scott Aaronson
,
Adam Bouland
,
Greg Kuperberg
,
Saeed Mehraban
STOC
,
317327
,
2017
Fetch

Report

Google
Assessing the Computational Complexity of Multilayer Subgraph Detection
Robert Bredereck
,
Christian Komusiewicz
,
Stefan Kratsch
,
Hendrik Molter
,
Rolf Niedermeier
,
Manuel Sorge
CIAC
,
128139
,
2017
Fetch

Report

Google
Computational Complexity of WavelengthBased Machine with Slightly Interacting Sets
Sama Goliaei
,
MohammadHadi ForoughmandAraabi
IJUC
,
13(2):117137
,
2017
Fetch

Report

Google
Lowdegree test with polynomially small error
Dana Moshkovitz
Computational Complexity
,
26(3):531582
,
2017
Fetch

Report

Google
Computational Complexity Reduction with MelFrequency FilterbankBased Approach for Multichannel Speech Enhancement
Jungpyo Hong
,
Sangbae Jeong
IEICE Transactions
,
100A(10):21542157
,
2017
Fetch

Report

Google
Computational complexity reduction for signal cyclostationarity detection based spectrum sensing
Shusuke Narieda
ISCAS
,
14
,
2017
Fetch

Report

Google
The Computational Complexity of Angry Birds and Similar PhysicsSimulation Games
Matthew Stephenson
,
Jochen Renz
,
Xiaoyu Ge
AIIDE
,
241247
,
2017
Fetch

Report

Google
On the computational complexity of bridgecard
Zihan Tan
J. Comb. Optim.
,
31(1):196217
,
2016
Fetch

Report

Google
An averagecase depth hierarchy theorem for higher depth
Johan Håstad
Electronic Colloquium on Computational Complexity (ECCC)
,
2341
,
2016
Fetch

Report

Google
Randomness Extraction in AC
^{0}
and with Small Locality
Kuan Cheng
,
Xin Li 0006
Electronic Colloquium on Computational Complexity (ECCC)
,
2318
,
2016
Fetch

Report

Google
The uniform distribution is complete with respect to testing identity to a fixed distribution
Oded Goldreich
Electronic Colloquium on Computational Complexity (ECCC)
,
2315
,
2016
Fetch

Report

Google
The Hilbert Function, Algebraic Extractors, and Recursive Fourier Sampling
Zachary Remscrim
Electronic Colloquium on Computational Complexity (ECCC)
,
2320
,
2016
Fetch

Report

Google
Pseudorandomness when the odds are against you
Sergei Artemenko
,
Russell Impagliazzo
,
Valentine Kabanets
,
Ronen Shaltiel
Electronic Colloquium on Computational Complexity (ECCC)
,
2337
,
2016
Fetch

Report

Google
Further extensions of Clifford circuits and their classical simulation complexities
Dax Enshan Koh
Electronic Colloquium on Computational Complexity (ECCC)
,
234
,
2016
Fetch

Report

Google
Algorithms from Natural Lower Bounds
Marco L. Carmosino
,
Russell Impagliazzo
,
Valentine Kabanets
,
Antonina Kolokolova
Electronic Colloquium on Computational Complexity (ECCC)
,
238
,
2016
Fetch

Report

Google
Dependency Schemes in QBF Calculi: Semantics and Soundness
Olaf Beyersdorff
,
Joshua Blinkhorn
Electronic Colloquium on Computational Complexity (ECCC)
,
2328
,
2016
Fetch

Report

Google
Complexity of Constraint Satisfaction Problems over Finite Substsets of Natural Numbers
Titus Dose
Electronic Colloquium on Computational Complexity (ECCC)
,
2331
,
2016
Fetch

Report

Google
Identity Testing for constantwidth, and commutative, readonce oblivious ABPs
Rohit Gurjar
,
Arpita Korwar
,
Nitin Saxena
Electronic Colloquium on Computational Complexity (ECCC)
,
239
,
2016
Fetch

Report

Google
Extractors for Near Logarithmic MinEntropy
Gil Cohen
,
Leonard J. Schulman
Electronic Colloquium on Computational Complexity (ECCC)
,
2314
,
2016
Fetch

Report

Google
SolutionGraphs of Boolean Formulas and Isomorphism
Patrick Scharpfenecker
,
Jacobo Torán
Electronic Colloquium on Computational Complexity (ECCC)
,
2324
,
2016
Fetch

Report

Google
Noisy population recovery in polynomial time
Anindya De
,
Michael E. Saks
,
Sijian Tang
Electronic Colloquium on Computational Complexity (ECCC)
,
2326
,
2016
Fetch

Report

Google
Universal Locally Testable Codes
Oded Goldreich
,
Tom Gur
Electronic Colloquium on Computational Complexity (ECCC)
,
2342
,
2016
Fetch

Report

Google
Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck
Eli BenSasson
,
Alessandro Chiesa
,
Ariel Gabizon
,
Michael Riabzev
,
Nicholas Spooner
Electronic Colloquium on Computational Complexity (ECCC)
,
2346
,
2016
Fetch

Report

Google
Circuit size lower bounds and #SAT upper bounds through a general framework
Alexander Golovnev
,
Alexander S. Kulikov
,
Alexander Smal
,
Suguru Tamaki
Electronic Colloquium on Computational Complexity (ECCC)
,
2322
,
2016
Fetch

Report

Google
A Note on Tolerant Testing with OneSided Error
Roei Tell
Electronic Colloquium on Computational Complexity (ECCC)
,
2332
,
2016
Fetch

Report

Google
Bounds on the Kolmogorov complexity function for infinite words
Ludwig Staiger
Electronic Colloquium on Computational Complexity (ECCC)
,
2313
,
2016
Fetch

Report

Google
Spooky Interaction and its Discontents: Compilers for Succinct TwoMessage Argument Systems
Cynthia Dwork
,
Moni Naor
,
Guy N. Rothblum
Electronic Colloquium on Computational Complexity (ECCC)
,
2349
,
2016
Fetch

Report

Google
Lifting QBF Resolution Calculi to DQBF
Olaf Beyersdorff
,
Leroy Chew
,
Renate A. Schmidt
,
Martin Suda 0001
Electronic Colloquium on Computational Complexity (ECCC)
,
2348
,
2016
Fetch

Report

Google
QuasiLinear Size Zero Knowledge from LinearAlgebraic PCPs
Eli BenSasson
,
Alessandro Chiesa
,
Ariel Gabizon
,
Madars Virza
Electronic Colloquium on Computational Complexity (ECCC)
,
231
,
2016
Fetch

Report

Google
Explicit NonMalleable Extractors, MultiSource Extractors and Almost Optimal Privacy Amplification Protocols
Eshan Chattopadhyay
,
Xin Li 0006
Electronic Colloquium on Computational Complexity (ECCC)
,
2336
,
2016
Fetch

Report

Google
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity
Michael A. Forbes
,
Mrinal Kumar
,
Ramprasad Saptharishi
Electronic Colloquium on Computational Complexity (ECCC)
,
2345
,
2016
Fetch

Report

Google
Structure of protocols for XOR functions
Kaave Hosseini
,
Shachar Lovett
Electronic Colloquium on Computational Complexity (ECCC)
,
2344
,
2016
Fetch

Report

Google
Understanding Gentzen and Frege systems for QBF
Olaf Beyersdorff
,
Ján Pich
Electronic Colloquium on Computational Complexity (ECCC)
,
2311
,
2016
Fetch

Report

Google
Noisy Population Recovery from Unknown Noise
Shachar Lovett
,
Jiapeng Zhang
Electronic Colloquium on Computational Complexity (ECCC)
,
2321
,
2016
Fetch

Report

Google
Affine Relativization: Unifying the Algebrization and Relativization Barriers
Baris Aydinlioglu
,
Eric Bach
Electronic Colloquium on Computational Complexity (ECCC)
,
2340
,
2016
Fetch

Report

Google
On the Computational Complexity of MaxSAT
Mohamed El Halaby
Electronic Colloquium on Computational Complexity (ECCC)
,
2334
,
2016
Fetch

Report

Google
On the Width of SemiAlgebraic Proofs and Algorithms
Alexander A. Razborov
Electronic Colloquium on Computational Complexity (ECCC)
,
2310
,
2016
Fetch

Report

Google
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
Meena Mahajan
,
Nitin Saurabh
Electronic Colloquium on Computational Complexity (ECCC)
,
2338
,
2016
Fetch

Report

Google
Tribes Is Hard in the Message Passing Model
Sagnik Mukhopadhyay
Electronic Colloquium on Computational Complexity (ECCC)
,
2327
,
2016
Fetch

Report

Google
Limitations of Linear Programming Techniques for Bounded Color Matchings
Georgios Stamoulis
Electronic Colloquium on Computational Complexity (ECCC)
,
2317
,
2016
Fetch

Report

Google
Doubly infinite separation of quantum information and communication
ZiWen Liu
,
Christopher Perry
,
Yechao Zhu
,
Dax Enshan Koh
,
Scott Aaronson
Electronic Colloquium on Computational Complexity (ECCC)
,
2316
,
2016
Fetch

Report

Google
New hardness results for graph and hypergraph colorings
Joshua Brakensiek
,
Venkatesan Guruswami
Electronic Colloquium on Computational Complexity (ECCC)
,
2329
,
2016
Fetch

Report

Google
The Fourier structure of low degree polynomials
Shachar Lovett
Electronic Colloquium on Computational Complexity (ECCC)
,
2325
,
2016
Fetch

Report

Google
On QResolution and CDCL QBF Solving
Mikolas Janota
Electronic Colloquium on Computational Complexity (ECCC)
,
2343
,
2016
Fetch

Report

Google
Autoreducibility of NPComplete Sets
John M. Hitchcock
,
Hadi Shafei
Electronic Colloquium on Computational Complexity (ECCC)
,
2312
,
2016
Fetch

Report

Google
On the logspace shortest path problem
Boris Brimkov
,
Illya V. Hicks
Electronic Colloquium on Computational Complexity (ECCC)
,
233
,
2016
Fetch

Report

Google
Parallel repetition via fortification: analytic view and the quantum case
Mohammad Bavarian
,
Thomas Vidick
,
Henry Yuen
Electronic Colloquium on Computational Complexity (ECCC)
,
2347
,
2016
Fetch

Report

Google
Complexity Classification of TwoQubit Commuting Hamiltonians
Adam Bouland
,
Laura Mancinska
,
Xue Zhang
Electronic Colloquium on Computational Complexity (ECCC)
,
2339
,
2016
Fetch

Report

Google
Extension Variables in QBF Resolution
Olaf Beyersdorff
,
Leroy Chew
,
Mikolas Janota
Electronic Colloquium on Computational Complexity (ECCC)
,
235
,
2016
Fetch

Report

Google
Strong ETH Breaks With Merlin and Arthur: Short NonInteractive Proofs of Batch Evaluation
Ryan Williams 0001
Electronic Colloquium on Computational Complexity (ECCC)
,
232
,
2016
Fetch

Report

Google
Property Testing, PCP, andJuntas
Guy Kindler
Electronic Colloquium on Computational Complexity (ECCC)
,
237
,
2016
Fetch

Report

Google
Tight bounds for communication assisted agreement distillation
Venkatesan Guruswami
,
Jaikumar Radhakrishnan
Electronic Colloquium on Computational Complexity (ECCC)
,
2333
,
2016
Fetch

Report

Google
Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity
Irit Dinur
,
Or Meir
Electronic Colloquium on Computational Complexity (ECCC)
,
2335
,
2016
Fetch

Report

Google
How to Share a Secret, Infinitely
Ilan Komargodski
,
Moni Naor
,
Eylon Yogev
Electronic Colloquium on Computational Complexity (ECCC)
,
2323
,
2016
Fetch

Report

Google
An almost Cubic Lower Bound for Depth Three Arithmetic Circuits
Neeraj Kayal
,
Chandan Saha 0001
,
Sébastien Tavenas
Electronic Colloquium on Computational Complexity (ECCC)
,
236
,
2016
Fetch

Report

Google
NonMalleable Extractors with Logarithmic Seeds
Gil Cohen
Electronic Colloquium on Computational Complexity (ECCC)
,
2330
,
2016
Fetch

Report

Google
Fast Learning Requires Good Memory: A TimeSpace Lower Bound for Parity Learning
Ran Raz
Electronic Colloquium on Computational Complexity (ECCC)
,
2319
,
2016
Fetch

Report

Google
Interval Linear Algebra and Computational Complexity
Jaroslav Horácek
,
Milan Hladík
,
Michal Cerný
CoRR
,
abs/1602.00349
,
2016
Fetch

Report

Google
On the computational complexity of minimumconcavecost flow in a twodimensional grid
Shabbir Ahmed
,
Qie He
,
Shi Li
,
George L. Nemhauser
CoRR
,
abs/1602.08515
,
2016
Fetch

Report

Google
A Note on the Computational Complexity of Unsmoothened Vertex Attack Tolerance
Gunes Ercal
CoRR
,
abs/1603.08430
,
2016
Fetch

Report

Google
The Computational Complexity of the Frobenius Problem
Shunichi Matsubara
CoRR
,
abs/1602.05657
,
2016
Fetch

Report

Google
On the computational complexity of exterior products
Dmitri A. Ivanov
CoRR
,
abs/1603.02724
,
2016
Fetch

Report

Google
On the computational complexity of algebraic numbers: the HartmanisStearns problem revisited
Boris Adamczewski
,
Julien Cassaigne
,
Marion Le Gonidec
CoRR
,
abs/1601.02771
,
2016
Fetch

Report

Google
The Computational Complexity of Duality
Shmuel Friedland
,
LekHeng Lim
CoRR
,
abs/1601.07629
,
2016
Fetch

Report

Google
Unprovable Security of Perfect NIZK and Noninteractive Nonmalleable Commitments
Rafael Pass
Computational Complexity
,
25(3):607666
,
2016
Fetch

Report

Google
A counterexample to the chain rule for conditional HILL entropy
Stephan Krenn
,
Krzysztof Pietrzak
,
Akshay Wadia
,
Daniel Wichs
Computational Complexity
,
25(3):567605
,
2016
Fetch

Report

Google
Special Issue on the 10th Theory of Cryptography Conference: Editor's Foreword
Oded Goldreich
Computational Complexity
,
25(3):563565
,
2016
Fetch

Report

Google
Affine Projection Subband Adaptive Filter With Low Computational Complexity
Mariane R. Petraglia
,
Diego B. Haddad
,
Elias L. Marques
IEEE Trans. on Circuits and Systems
,
63II(10):989993
,
2016
Fetch

Report

Google
The multiparty communication complexity of interleaved group products
Timothy Gowers
,
Emanuele Viola
Electronic Colloquium on Computational Complexity (ECCC)
,
23127
,
2016
Fetch

Report

Google
On SZK and PP
Adam Bouland
,
Lijie Chen
,
Dhiraj Holden
,
Justin Thaler
,
Prashant Nalini Vasudevan
Electronic Colloquium on Computational Complexity (ECCC)
,
23140
,
2016
Fetch

Report

Google
Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces
Markus Bläser
,
Gorav Jindal
,
Anurag Pandey
Electronic Colloquium on Computational Complexity (ECCC)
,
23145
,
2016
Fetch

Report

Google
Finer separations between shallow arithmetic circuits
Mrinal Kumar
,
Ramprasad Saptharishi
Electronic Colloquium on Computational Complexity (ECCC)
,
23137
,
2016
Fetch

Report

Google
A Õ(n) NonAdaptive Tester for Unateness
Deeparnab Chakrabarty
,
C. Seshadhri
Electronic Colloquium on Computational Complexity (ECCC)
,
23133
,
2016
Fetch

Report

Google
Approximate Degree and the Complexity of Depth Three Circuits
Mark Bun
,
Justin Thaler
Electronic Colloquium on Computational Complexity (ECCC)
,
23121
,
2016
Fetch

Report

Google
Testing kMonotonicity
Clément L. Canonne
,
Elena Grigorescu
,
Siyao Guo
,
Akash Kumar 0003
,
Karl Wimmer
Electronic Colloquium on Computational Complexity (ECCC)
,
23136
,
2016
Fetch

Report

Google
From Weak to Strong LP Gaps for all CSPs
Mrinal Kanti Ghosh
,
Madhur Tulsiani
Electronic Colloquium on Computational Complexity (ECCC)
,
23117
,
2016
Fetch

Report

Google
Tropical Complexity, Sidon Sets, and Dynamic Programming
Stasys Jukna
Electronic Colloquium on Computational Complexity (ECCC)
,
23123
,
2016
Fetch

Report

Google
Improved NonMalleable Extractors, NonMalleable Codes and Independent Source Extractors
Xin Li 0006
Electronic Colloquium on Computational Complexity (ECCC)
,
23115
,
2016
Fetch

Report

Google
On the Limits of Gate Elimination
Alexander Golovnev
,
Edward A. Hirsch
,
Alexander Knop
,
Alexander S. Kulikov
Electronic Colloquium on Computational Complexity (ECCC)
,
23119
,
2016
Fetch

Report

Google
On multiparty communication with large versus unbounded error
Alexander A. Sherstov
Electronic Colloquium on Computational Complexity (ECCC)
,
23138
,
2016
Fetch

Report

Google
Local Expanders
Emanuele Viola
,
Avi Wigderson
Electronic Colloquium on Computational Complexity (ECCC)
,
23129
,
2016
Fetch

Report

Google
Threshold Secret Sharing Requires a Linear Size Alphabet
Andrej Bogdanov
,
Siyao Guo
,
Ilan Komargodski
Electronic Colloquium on Computational Complexity (ECCC)
,
23131
,
2016
Fetch

Report

Google
Mildly exponential reduction from gap 3SAT to polynomialgap labelcover
Irit Dinur
Electronic Colloquium on Computational Complexity (ECCC)
,
23128
,
2016
Fetch

Report

Google
Local Testing for Membership in Lattices
Karthekeyan Chandrasekaran
,
Mahdi Cheraghchi
,
Venkata Gandikota
,
Elena Grigorescu
Electronic Colloquium on Computational Complexity (ECCC)
,
23125
,
2016
Fetch

Report

Google
SOS is not obviously automatizable, even approximately
Ryan O'Donnell
Electronic Colloquium on Computational Complexity (ECCC)
,
23141
,
2016
Fetch

Report

Google
Explicit ListDecodable Codes with Optimal Rate for Computationally Bounded Channels
Ronen Shaltiel
,
Jad Silbak
Electronic Colloquium on Computational Complexity (ECCC)
,
23134
,
2016
Fetch

Report

Google
An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP
Nikhil Balaji
,
Nutan Limaye
,
Srikanth Srinivasan
Electronic Colloquium on Computational Complexity (ECCC)
,
23143
,
2016
Fetch

Report

Google
NearOptimal Lower Bounds on Quantifier Depth and WeisfeilerLeman Refinement Steps
Christoph Berkholz
,
Jakob Nordström
Electronic Colloquium on Computational Complexity (ECCC)
,
23135
,
2016
Fetch

Report

Google
Exact constructive and computable dimensions
Ludwig Staiger
Electronic Colloquium on Computational Complexity (ECCC)
,
23139
,
2016
Fetch

Report

Google
Tight Network Topology Dependent Bounds on Rounds of Communication
Arkadev Chattopadhyay
,
Michael Langberg
,
Shi Li
,
Atri Rudra
Electronic Colloquium on Computational Complexity (ECCC)
,
23130
,
2016
Fetch

Report

Google
On the impossibility of entropy reversal, and its application to zeroknowledge proofs
Shachar Lovett
,
Jiapeng Zhang
Electronic Colloquium on Computational Complexity (ECCC)
,
23118
,
2016
Fetch

Report

Google
An Õ(n) Queries Adaptive Tester for Unateness
Subhash Khot
,
Igor Shinkar
Electronic Colloquium on Computational Complexity (ECCC)
,
23126
,
2016
Fetch

Report

Google
TwoSource Extractors for QuasiLogarithmic MinEntropy and Improved Privacy Amplification Protocols
Gil Cohen
Electronic Colloquium on Computational Complexity (ECCC)
,
23114
,
2016
Fetch

Report

Google
Bounding laconic proof systems by solving CSPs in parallel
Jason Li
,
Ryan O'Donnell
Electronic Colloquium on Computational Complexity (ECCC)
,
23142
,
2016
Fetch

Report

Google
Approximating CSPs using LP Relaxation
Subhash Khot
,
Rishi Saket
Electronic Colloquium on Computational Complexity (ECCC)
,
23116
,
2016
Fetch

Report

Google
Locally testable and Locally correctable Codes Approaching the GilbertVarshamov Bound
Sivakanth Gopi
,
Swastik Kopparty
,
Rafael Mendes de Oliveira
,
Noga RonZewi
,
Shubhangi Saraf
Electronic Colloquium on Computational Complexity (ECCC)
,
23122
,
2016
Fetch

Report

Google
Expander Construction in VNC
^{1}
Sam Buss
,
Valentine Kabanets
,
Antonina Kolokolova
,
Michal Koucky
Electronic Colloquium on Computational Complexity (ECCC)
,
23144
,
2016
Fetch

Report

Google
On approximating the eigenvalues of stochastic matrices in probabilistic logspace
Dean Doron
,
Amir Sarid
,
Amnon TaShma
Electronic Colloquium on Computational Complexity (ECCC)
,
23120
,
2016
Fetch

Report

Google
On the Sensitivity Conjecture for Readk Formulas
Mitali Bafna
,
Satyanarayana V. Lokam
,
Sébastien Tavenas
,
Ameya Velingker
Electronic Colloquium on Computational Complexity (ECCC)
,
23132
,
2016
Fetch

Report

Google
On Independent Sets, 2to2 Games and Grassmann Graphs
Subhash Khot
,
Dor Minzer
,
Muli Safra
Electronic Colloquium on Computational Complexity (ECCC)
,
23124
,
2016
Fetch

Report

Google
On the computational complexity and generalization properties of multistage and stagewise coupled scenario programs
Nikolaos Kariotoglou
,
Kostas Margellos
,
John Lygeros
Systems & Control Letters
,
946369
,
2016
Fetch

Report

Google
A comment on "computational complexity of stochastic programming problems"
Grani Adiwena Hanasusanto
,
Daniel Kuhn
,
Wolfram Wiesemann
Math. Program.
,
159(12):557569
,
2016
Fetch

Report

Google
Computational complexity of solving polynomial differential equations over unbounded domains with nonrational coefficients
Amaury Pouly
CoRR
,
abs/1608.00135
,
2016
Fetch

Report

Google
Solution Concepts in ALoss Recall Games: Existence and Computational Complexity
Jiri Cermak
,
Branislav Bosanský
,
Michal Pechoucek
CoRR
,
abs/1608.01500
,
2016
Fetch

Report

Google
On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling
Jeremiah Blocki
,
Samson Zhou
CoRR
,
abs/1609.04449
,
2016
Fetch

Report

Google
Quantum commitments from complexity assumptions
André Chailloux
,
Iordanis Kerenidis
,
Bill Rosgen
Computational Complexity
,
25(1):103151
,
2016
Fetch

Report

Google
Relativizing small complexity classes and their theories
Klaus Aehlig
,
Stephen A. Cook
,
Phuong Nguyen
Computational Complexity
,
25(1):177215
,
2016
Fetch

Report

Google
Combinatorial PCPs with Short Proofs
Or Meir
Computational Complexity
,
25(1):1102
,
2016
Fetch

Report

Google
On the power of algebraic branching programs of width two
Eric Allender
,
Fengming Wang
Computational Complexity
,
25(1):217253
,
2016