Suguru Tamaki

Available identifiers

zbMath Open tamaki.suguruMaRDI QIDQ354654

List of research outcomes

Publication	Date of Publication	Type
Parallel Repetition of Two-Prover One-Round Games: An Exposition	2020-11-19	Paper
An improved fixed-parameter algorithm for max-cut parameterized by crossing number	2020-02-25	Paper
Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression	2019-08-07	Paper
Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues	2019-03-28	Paper
Beating Brute Force for Systems of Polynomial Equations over Finite Fields	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4608607	2018-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q4608645	2018-03-21	Paper
Gate elimination: circuit size lower bounds and \#SAT upper bounds	2018-03-12	Paper
Quantum query complexity of unitary operator discrimination	2017-10-23	Paper
https://portal.mardi4nfdi.de/entity/Q5363763	2017-09-29	Paper
Improved exact algorithms for mildly sparse instances of MAX SAT	2017-09-28	Paper
Local restrictions from the Furst-Saxe-Sipser paper	2017-03-31	Paper
https://portal.mardi4nfdi.de/entity/Q2969636	2017-03-22	Paper
Linear programming, width-1 CSPs, and robust satisfaction	2016-10-07	Paper
Solving sparse instances of Max SAT via width reduction and greedy restriction	2016-01-28	Paper
A query efficient non-adaptive long code test with perfect completeness	2015-10-12	Paper
https://portal.mardi4nfdi.de/entity/Q5501274	2015-08-03	Paper
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction	2014-09-26	Paper
Derandomizing the HSSW algorithm for 3-SAT	2013-11-11	Paper
A satisfiability algorithm and average-case hardness for formulas over the full binary basis	2013-07-19	Paper
Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues	2012-11-02	Paper
An exact algorithm for the Boolean connectivity problem for \(k\)-CNF	2011-09-12	Paper
Derandomizing the HSSW algorithm for 3-SAT	2011-08-17	Paper
Improved Randomized Algorithms for 3-SAT	2010-12-09	Paper
On the Boolean connectivity problem for Horn relations	2010-11-25	Paper
An Exact Algorithm for the Boolean Connectivity Problem for k-CNF	2010-09-29	Paper
A Query Efficient Non-adaptive Long Code Test with Perfect Completeness	2010-09-10	Paper
The complexity of the Hajós calculus for planar graphs	2010-03-09	Paper
On the Boolean Connectivity Problem for Horn Relations	2009-03-10	Paper
Exploiting partial knowledge of satisfying assignments	2007-08-23	Paper
https://portal.mardi4nfdi.de/entity/Q4785576	2003-01-05	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Suguru Tamaki